Which codes have cycle-free Tanner graphs?

DOI10.1109/18.782170zbMath0958.94028OpenAlexW2127875464MaRDI QIDQ4503390

Alexander Vardy, Ari Trachtenberg, Tuvi Etzion

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/08b0548b3df10fcd917812ae1bc97a317628e568

zbMATH Keywords

asymptoticsminimum distanceiterative decodinglinear block codeTanner graphs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (6)

New Results on the Pseudoredundancy ⋮ Codes with girth 8 Tanner graph representation ⋮ Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory ⋮ A library for formalization of linear error-correcting codes ⋮ Codes with the identifiable parent property for multimedia fingerprinting ⋮ Pseudocodeword-free criterion for codes with cycle-free Tanner graph

This page was built for publication: Which codes have cycle-free Tanner graphs?