1 citations · 1 across the 6 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2026
Covering in Hamming and Grassmann Spaces: New Bounds and Reed--Solomon-Based Constructions
Samin Riasat, Hessam Mahdavifar
We study covering problems in Hamming and Grassmann spaces through a unified coding-theoretic and information-theoretic framework. Viewing covering as a form of quantization in gen…
cs.IT2025
Efficient Covering Using Reed--Solomon Codes
Samin Riasat, Hessam Mahdavifar
We propose an efficient algorithm to find a Reed-Solomon (RS) codeword at a distance within the covering radius of the code from any point in its ambient Hamming space. To the best…
cs.IT2024
Decoding Analog Subspace Codes: Algorithms for Character-Polynomial Codes
Samin Riasat, Hessam Mahdavifar
We propose efficient minimum-distance decoding and list-decoding algorithms for a certain class of analog subspace codes, referred to as character-polynomial (CP) codes, recently i…