A new formula for the minimum distance of an expander code

DOI10.13069/JACODESMATH.1111379MaRDI QIDQ5884135zbMATH OpenOpenAlexFDO

Authors Sudipta Mallik

Publication date 20 March 2023

Published in Journal of Algebra Combinatorics Discrete Structures and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.01339

zbMATH Keywords

adjacency matrixexpander graphlinear codeminimum distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Recommendations

• Distance properties of expander codes
• On the sizes of expander graphs and minimum distances of graph codes
• The minimum distance of graph codes
• scientific article; zbMATH DE number 5010757
• On Tanner codes: Minimum distance and decoding

Cites work

• A recursive approach to low complexity codes
• Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
• Expander codes
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• Introduction to Coding Theory
• Isodual and self-dual codes from graphs
• On expander codes
• Randomness conductors and constant-degree lossless expanders

Cited in

(6)

• Improvement on minimum distance of symbol-pair codes
• On the sizes of expander graphs and minimum distances of graph codes
• The minimum distance of graph codes
• Distance properties of expander codes
• A New Formula for the Minimum Distance of an Expander Code
• Codes from incidence matrices of hypergraphs

This page was built for publication: A new formula for the minimum distance of an expander code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5884135)