The smallest length of eight-dimensional binary linear codes with prescribed minimum distance
From MaRDI portal
Publication:4503617
DOI10.1109/18.850690zbMath0997.94553OpenAlexW2158599671MaRDI QIDQ4503617
David B. Jaffe, Veselin Vladislavov Vavrek, Iliya G. Bouyukliev
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.850690
Related Items
PIR codes with short block length ⋮ On the binary projective codes with dimension 6 ⋮ The \([46, 9, 20_2\) code is unique] ⋮ On optimal linear codes over \(\mathbb F_5\) ⋮ New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)
This page was built for publication: The smallest length of eight-dimensional binary linear codes with prescribed minimum distance