On the combinatorial structure of a class of [ m 2, m-12, 3] shortened Hamming codes and their dual-codes

DOI10.1016/J.DAM.2008.03.004MaRDI QIDQ1003680zbMATH OpenOpenAlexFDO

Authors 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 radiuscycle distributionLDGM codes

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Applications of graph theory (05C90) Linear codes (general theory) (94B05)

Recommendations

• On covering radius of a family of codes \({\mathcal C}_m\cup(1+{\mathcal C}_m)\) with maximum distance between \({\mathcal C}_m\) and \(1+{\mathcal C}_m\)
• scientific article; zbMATH DE number 5543120
• Short codes with a given covering radius
• The covering radius of Hadamard codes in odd graphs
• scientific article; zbMATH DE number 1284421

Cites work

• A recursive approach to low complexity codes
• An algorithm for counting short cycles in bipartite graphs
• Covering radius 1985-1994
• Covering radius---Survey and recent results
• Factor graphs and the sum-product algorithm
• Four fundamental parameters of a code and their combinatorial significance
• Graph theory
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1277120 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• Iterative decoding of binary block and convolutional codes
• LDGM codes for channel coding and joint source-channel coding of correlated sources
• New 5-designs
• On the covering radius of binary codes (Corresp.)
• On the covering radius of codes
• The covering radius of cyclic codes of length up to 31 (Corresp.)

Cited in

(3)

• The covering radius of Hadamard codes in odd graphs
• scientific article; zbMATH DE number 177895 (Why is no real title available?)
• Stopping sets of codes from complete graph

Describes a project that uses

Uses Software

• LDGM

This page was built for publication: 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

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