Construction of Linear Codes With Large Minimum Distance
From MaRDI portal
Publication:3546609
DOI10.1109/TIT.2004.831742zbMATH Open1225.94021OpenAlexW2129807965MaRDI QIDQ3546609FDOQ3546609
Authors:
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
Recommendations
Cited In (17)
- New codes from old; a new geometric construction
- Update on the Extension of Good Linear Codes
- Construction of binary and ternary self-orthogonal linear codes
- Title not available (Why is that?)
- An Elementary Construction of Codes From the Groups of Units of Residue Rings of Polynomials
- \((l,s)\)-extension of linear codes
- New linear codes with prescribed group of automorphisms found by heuristic search
- Constructing two-weight codes with prescribed groups of automorphisms
- An analysis of Chen's construction of minimum-distance five codes
- Optimal Linear Codes From Matrix Groups
- A \(\mathbb Z_{4}\)-linear code of high minimum Lee distance derived from a hyperoval
- Title not available (Why is that?)
- Searching for linear codes with large minimum distance
- Classification and nonexistence results for linear codes with prescribed minimum distances
- \(q\)-analogs of packing designs
- Linear codes from Denniston maximal arcs
- A Heuristic Algorithm for the Construction of Good Linear Codes
This page was built for publication: Construction of Linear Codes With Large Minimum Distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546609)
