On Tanner codes: Minimum distance and decoding

DOI10.1007/s00200-003-0098-4zbMath1031.94018OpenAlexW2137271753MaRDI QIDQ1566399

Heeralal Janwa, Arbind Kumar Lal

Publication date: 2 June 2003

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-003-0098-4

zbMATH Keywords

decodingminimum distanceLDPC codesmultipartite graphRamanujan graph\(n\)-gonexpander graphexpander codesTanner codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial codes (94B25) Decoding (94B35)

Related Items (3)

Spectral gap in random bipartite biregular graphs and applications ⋮ The Minimum Distance of Graph Codes ⋮ Eigenvalues and expansion of bipartite graphs

This page was built for publication: On Tanner codes: Minimum distance and decoding