New Results on the Pseudoredundancy

DOI10.4134/BKMS.b180141zbMath1411.94099arXiv1410.1627OpenAlexW2963111854MaRDI QIDQ4968623

Marcus Greferath, Xin-Wen Wu, Jens Zumbrägel, Zi-Hui Liu

Publication date: 16 July 2019

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

zbMATH Keywords

LDPC codesfundamental conevalue assignmentpseudoweightpseudocodeword redundancysubcode-complete

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

Value functions and two classes of binary codes

Cites Work

• Unnamed Item
• Notes on the value function
• On relative constant-weight codes
• Eigenvalue bounds on the pseudocodeword weight of expander codes
• Using Linear Programming to Decode Binary Linear Codes
• On the stopping distance and the stopping redundancy of codes
• The weight hierarchies of q-ary codes of dimension 4
• Which codes have cycle-free Tanner graphs?
• On the Pseudocodeword Redundancy of Binary Linear Codes

This page was built for publication: New Results on the Pseudoredundancy