Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
From MaRDI portal
Publication:375966
DOI10.1134/S0032946011040028zbMATH Open1302.94071MaRDI QIDQ375966FDOQ375966
Authors: Alexey Frolov, V. V. Zyablov 
Publication date: 1 November 2013
Published in: Problems of Information Transmission (Search for Journal in Brave)
Recommendations
- Minimum-distance bounds by graph analysis
- Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes
- The minimum distance of graph codes
- Upper bounds on the rate of LDPC codes as a function of minimum distance
- Distance properties of expander codes
Cites Work
- Expander codes
- Ramanujan graphs
- Title not available (Why is that?)
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- A recursive approach to low complexity codes
- Weight distribution and decoding of codes on hypergraphs
- Distance properties of expander codes
- Upper bounds on the rate of LDPC codes as a function of minimum distance
- Improved Nearly-MDS Expander Codes
- Title not available (Why is that?)
- On expander codes
- Title not available (Why is that?)
Cited In (6)
- The minimum distance of graph codes
- Title not available (Why is that?)
- Minimum-distance bounds by graph analysis
- Vectorizing computations at decoding of nonbinary codes with small density of checks
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
- Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes
This page was built for publication: Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375966)
