Construction of Linear Codes With Large Minimum Distance
From MaRDI portal
Publication:3546609
DOI10.1109/TIT.2004.831742zbMath1225.94021OpenAlexW2129807965MaRDI QIDQ3546609
No author found.
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.2004.831742
Related Items (5)
q-Analogs of Packing Designs ⋮ Constructing two-weight codes with prescribed groups of automorphisms ⋮ \((l,s)\)-extension of linear codes ⋮ Construction of binary and ternary self-orthogonal linear codes ⋮ Update on the Extension of Good Linear Codes
This page was built for publication: Construction of Linear Codes With Large Minimum Distance