Minimum-distance bounds by graph analysis
From MaRDI portal
Recommendations
- Minimum distance and pseudodistance lower bounds for generalised LDPC codes
- Upper bounds on the rate of LDPC codes as a function of minimum distance
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
- On the sizes of expander graphs and minimum distances of graph codes
Cited in
(17)- On Tanner codes: Minimum distance and decoding
- LDPC codes constructed from cubic symmetric graphs
- Minimizing branching vertices in distance-preserving subgraphs
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- A Deterministic Reduction for the Gap Minimum Distance Problem
- The minimum distance of graph codes
- On full-rank parity-check matrices of product codes
- Bounds on the Expansion Properties of Tanner Graphs
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
- Bounds for the minimum distance function
- Minimum distance and pseudodistance lower bounds for generalised LDPC codes
- Eigenvalues and expansion of bipartite graphs
- On codewords in the dual code of classical generalised quadrangles and classical polar spaces
- Regular LDPC codes from semipartial geometries
- Minimum difference representations of graphs
This page was built for publication: Minimum-distance bounds by graph analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544523)
