Bounds on the minimum code distance for nonbinary codes based on bipartite graphs

DOI10.1134/S0032946011040028zbMath1302.94071MaRDI QIDQ375966

Victor Zyablov, Alexey Frolov

Publication date: 1 November 2013

Published in: Problems of Information Transmission (Search for Journal in Brave)

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60)

Related Items (2)

Vectorizing computations at decoding of nonbinary codes with small density of checks ⋮ Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weight distribution and decoding of codes on hypergraphs
• Ramanujan graphs
• Expander codes
• Distance properties of expander codes
• Upper bounds on the rate of LDPC codes as a function of minimum distance
• Improved Nearly-MDS Expander Codes
• A recursive approach to low complexity codes
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On expander codes

This page was built for publication: Bounds on the minimum code distance for nonbinary codes based on bipartite graphs