Codes from Expander Graphs

DOI10.1007/978-3-540-87448-5_9zbMATH Open1166.94360OpenAlexW1484375846MaRDI QIDQ3540923FDOQ3540923

Authors: Tom Høholdt 

Publication date: 25 November 2008

Published in: Coding Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87448-5_9

Recommendations

• Expander codes
• scientific article; zbMATH DE number 1552123
• scientific article; zbMATH DE number 5010757
• Multilevel expander codes
• Good Expander Graphs and Expander Codes: Parameters and Decoding

Mathematics Subject Classification ID

Other types of codes (94B60)

Cited In (15)

• Weight distribution and decoding of codes on hypergraphs
• The minimum distance of graph codes
• Optimal bipartite Ramanujan graphs from balanced incomplete block designs: their characterizations and applications to expander/LDPC codes
• Title not available (Why is that?)
• Zig-zag and replacement product graphs and LDPC codes
• Codes over graphs
• Graph connectivities, network coding, and expander graphs
• Improved Nearly-MDS Expander Codes
• Graph-based codes
• On the sizes of expander graphs and minimum distances of graph codes
• Multilevel expander codes
• Improving the Alphabet-Size in Expander-Based Code Constructions
• Some combinatorial aspects of constructing bipartite-graph codes
• Title not available (Why is that?)
• Codes with girth 8 Tanner graph representation

This page was built for publication: Codes from Expander Graphs

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