Construction of Linear Codes With Large Minimum Distance

DOI10.1109/TIT.2004.831742MaRDI QIDQ3546609zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)

Recommendations

• scientific article; zbMATH DE number 5054194
• A Heuristic Algorithm for the Construction of Good Linear Codes
• Searching for linear codes with large minimum distance
• Optimal Linear Codes From Matrix Groups
• Classification and nonexistence results for linear codes with prescribed minimum distances

Cited in

(17)

• A Heuristic Algorithm for the Construction of Good Linear Codes
• Construction of binary and ternary self-orthogonal linear codes
• Update on the Extension of Good Linear Codes
• New codes from old; a new geometric construction
• scientific article; zbMATH DE number 51008 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 671739 (Why is no real title available?)
• 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

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)