Suslin-Rao Codes : the bridge between pure and applied
Abstract
In the year $1977,$ while developing the theory of modules arising in the context of Serre's problem on projective modules in the paper ``On Stably Free Modules" (see \cite{AS}), A. A. Suslin constructed matrices inductively using unimodular rows. Our aim is to connect these matrices to the current and applicable field of coding theory. To this end, we construct Suslin-Rao codes, by using looking at certain unimodular all one vectors over the finite field 𝔽2. Comparative analysis with standard families such as Hamming, Simplex and BCH codes shows that the Suslin-Rao codes achieve better performance than Hamming and Simplex codes in terms of code rate and error correction capability, though BCH codes may outperform them for large code lengths. Bit error rate (BER) versus signal-to-noise ratio (SNR) simulations further support the practical applicability of these codes in noisy channels. The recursive nature of the construction allows efficient encoder design, making the proposed codes attractive for real-time communication systems and hardware implementation.
Related
- Alphabet-Dependent Bounds for Pure Quantum (r,ρ)-Locally Recoverable Codes
- Plotkin-optimal pure quantum LRCs with large minimum distances from NMDS codes
- Optimal Pure Quantum (r,δ)-LRCs from Euclidean and Hermitian Dual-Containing Cyclic Codes
- Suslin's cancellation conjecture on smooth real affine varieties with few real points
- Quagmires and large Suslin forests
BibTeX
@misc{kenjale2026suslinrao,
title = {{Suslin-Rao Codes : the bridge between pure and applied}},
author = {Nitin Kenjale and Anuradha S. Garge},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.03746},
eprint = {2610.03746},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.03746},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Suslin-Rao Codes : the bridge between pure and applied
AU - Nitin Kenjale
AU - Anuradha S. Garge
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2610.03746
UR - https://arxiv.org/abs/2610.03746
AB - In the year $1977,$ while developing the theory of modules arising in the context of Serre's problem on projective modules in the paper ``On Stably Free Modules" (see \cite{AS}), A. A. Suslin constructed matrices inductively using unimodular rows. Our aim is to connect these matrices to the current and applicable field of coding theory. To this end, we construct Suslin-Rao codes, by using looking at certain unimodular all one vectors over the finite field 𝔽_2. Comparative analysis with standard families such as Hamming, Simplex and BCH codes shows that the Suslin-Rao codes achieve better performance than Hamming and Simplex codes in terms of code rate and error correction capability, though BCH codes may outperform them for large code lengths. Bit error rate (BER) versus signal-to-noise ratio (SNR) simulations further support the practical applicability of these codes in noisy channels. The recursive nature of the construction allows efficient encoder design, making the proposed codes attractive for real-time communication systems and hardware implementation.
ER -