Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
From MaRDI portal
(Redirected from Publication:375966)
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
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- scientific article; zbMATH DE number 3410920 (Why is no real title available?)
- A recursive approach to low complexity codes
- Distance properties of expander codes
- Expander codes
- Improved Nearly-MDS Expander Codes
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- On expander codes
- Ramanujan graphs
- Upper bounds on the rate of LDPC codes as a function of minimum distance
- Weight distribution and decoding of codes on hypergraphs
Cited in
(6)- Minimum-distance bounds by graph analysis
- scientific article; zbMATH DE number 1285452 (Why is no real title available?)
- The minimum distance of graph codes
- 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
- Vectorizing computations at decoding of nonbinary codes with small density of checks
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)
