Error-Correction Capability of Binary Linear Codes
From MaRDI portal
Publication:3546994
DOI10.1109/TIT.2005.844080zbMath1293.94111OpenAlexW2157497332MaRDI QIDQ3546994
Vladimir I. Levenshtein, Torleiv Kløve, Tor Helleseth
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.844080
Related Items
On the weak order ideal associated to linear codes, Error-correction capability of Reed-Muller codes, Trial Set and Gröbner Bases for Binary Codes, Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes, Gröbner bases and combinatorics for binary codes, Computing coset leaders and leader codewords of binary codes, Computing an Invariant of a Linear Code, Reed-Muller Codes