A Decomposition Theory for Binary Linear Codes
From MaRDI portal
Publication:3604516
DOI10.1109/TIT.2008.924700zbMath1328.94083arXivcs/0611028OpenAlexW2115769160MaRDI QIDQ3604516
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0611028
Linear programming (90C05) Linear codes (general theory) (94B05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Combinatorial aspects of matroids and geometric lattices (05B35) Decoding (94B35)
Related Items
On matroids from self-orthogonal codes and their properties ⋮ Decomposition of modular codes for computing test sets and Graver basis ⋮ Pseudocodeword-free criterion for codes with cycle-free Tanner graph ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) ⋮ The highly connected matroids in minor-closed classes
