On the Pseudocodeword Redundancy of Binary Linear Codes

DOI10.1109/TIT.2012.2193661zbMath1365.94535arXiv1103.3641OpenAlexW1991706950MaRDI QIDQ5271846

M. F. Flanagan, Jens Zumbrägel, Vitaly Skachek

Publication date: 12 July 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (3)

New Results on the Pseudoredundancy ⋮ Pseudocodeword-free criterion for codes with cycle-free Tanner graph ⋮ Trellis complexity and pseudoredundancy of relative two-weight codes

This page was built for publication: On the Pseudocodeword Redundancy of Binary Linear Codes