Pseudocodeword-free criterion for codes with cycle-free Tanner graph

DOI10.1007/s10623-018-0476-3zbMath1442.94063arXiv1706.06648OpenAlexW2675590473MaRDI QIDQ1801093

Wittawat Kositwattanarerk

Publication date: 26 October 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.06648

zbMATH Keywords

low-density parity-check (LDPC) codepseudocodewordsiterative decodinglinear programming decodingTanner graphs

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear codes (general theory) (94B05) Decoding (94B35)

Uses Software

• LDPC

Cites Work

• On the cycle polytope of a binary matroid
• Decomposition of regular matroids
• Characterizations of pseudo-codewords of (low-density) parity-check codes
• Using Linear Programming to Decode Binary Linear Codes
• Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
• Pseudocodewords of Tanner Graphs
• Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
• A Decomposition Theory for Binary Linear Codes
• Which codes have cycle-free Tanner graphs?
• Factor graphs and the sum-product algorithm
• Design of capacity-approaching irregular low-density parity-check codes
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Analysis of Connections Between Pseudocodewords
• On the Pseudocodeword Redundancy of Binary Linear Codes
• Lifting the Fundamental Cone and Enumerating the Pseudocodewords of a Parity-Check Code