On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes

DOI10.1016/j.dam.2008.03.004zbMath1184.05105MaRDI QIDQ1003680

Morteza Esmaeili, Ali Zaghian

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.004

zbMATH Keywords

covering radius; LDGM codes; cycle distribution

Mathematics Subject Classification ID

05C90: Applications of graph theory

94B05: Linear codes (general theory)

05C75: Structural characterization of families of graphs

Uses Software

• LDGM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering radius 1985-1994
• LDGM codes for channel coding and joint source-channel coding of correlated sources
• An algorithm for counting short cycles in bipartite graphs
• The covering radius of cyclic codes of length up to 31 (Corresp.)
• On the covering radius of codes
• Covering radius---Survey and recent results
• A recursive approach to low complexity codes
• On the covering radius of binary codes (Corresp.)
• Factor graphs and the sum-product algorithm
• Iterative decoding of binary block and convolutional codes
• Four fundamental parameters of a code and their combinatorial significance
• New 5-designs