A Heuristic Algorithm for the Construction of Good Linear Codes

DOI10.1109/TIT.2008.920323zbMATH Open1328.94087OpenAlexW2113638917MaRDI QIDQ3604474FDOQ3604474

Authors: Johannes Zwanzger 

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2008.920323

Recommendations

• Construction of Linear Codes With Large Minimum Distance
• Searching for linear codes with large minimum distance
• scientific article; zbMATH DE number 5054194
• scientific article; zbMATH DE number 7434637
• A search algorithm for linear codes: Progressive dimension growth

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Linear codes (general theory) (94B05)

Cited In (10)

• Title not available (Why is that?)
• New linear codes with prescribed group of automorphisms found by heuristic search
• A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
• Construction of some binary linear codes of minimum distance five
• A search algorithm for linear codes: Progressive dimension growth
• Title not available (Why is that?)
• New linear codes from constacyclic codes
• Searching for linear codes with large minimum distance
• Classification and nonexistence results for linear codes with prescribed minimum distances
• Construction of Linear Codes With Large Minimum Distance

This page was built for publication: A Heuristic Algorithm for the Construction of Good Linear Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604474)