Low density parity check lattices based on construction D' and cycle-free Tanner graphs

MaRDI QIDQ3374404zbMATH OpenFDO

Authors Mohammad-Reza Sadeghi, Daniel Panario

Publication date 9 March 2006

zbMATH Keywords

nested codes

Mathematics Subject Classification ID

Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Relations with coding theory (11H71)

Recommendations

• On cycle-free lattices
• On cycle-free lattices with high rate label codes
• Which codes have cycle-free Tanner graphs?
• Which Codes Have$4$-Cycle-Free Tanner Graphs?
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles

Cited in

(2)

• On cycle-free lattices
• On cycle-free lattices with high rate label codes

This page was built for publication: Low density parity check lattices based on construction \(D'\) and cycle-free Tanner graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374404)