Which codes have cycle-free Tanner graphs?
From MaRDI portal
Recommendations
Cited in
(22)- On Tanner codes: Minimum distance and decoding
- Pseudocodeword-free criterion for codes with cycle-free Tanner graph
- A library for formalization of linear error-correcting codes
- Optimal codes as Tanner codes with cyclic component codes
- Codes with girth 8 Tanner graph representation
- Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory
- On cycle-free lattices
- Low density parity check lattices based on construction D' and cycle-free Tanner graphs
- Codes on graphs: constraint complexity of cycle-free realizations of linear codes
- Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach
- Which Codes Have$4$-Cycle-Free Tanner Graphs?
- Codes on planar Tanner graphs
- Graph Configurations and Decoding Performance
- New results on the pseudoredundancy
- Codes with the identifiable parent property for multimedia fingerprinting
- On cycle-free lattices with high rate label codes
- On Congruent Domination Number of Disjoint and One Point Union of Graphs
- Construction of storage codes of rate approaching one on triangle-free graphs
- Window code parameters of spatially-coupled LDPC codes
- A combinatorial approach to avoiding weak keys in the BIKE cryptosystem
- Codes based on dyadic matrices and their generalizations
- On the Hasse diagram of binary linear codes
This page was built for publication: Which codes have cycle-free Tanner graphs?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503390)
