Title :
A Heuristic Algorithm for the Construction of Good Linear Codes
Author :
Zwanzger, Johannes
Author_Institution :
Univ. of Bayreuth, Bayreuth
fDate :
5/1/2008 12:00:00 AM
Abstract :
In this correspondence, we describe a heuristic method for the construction of linear codes with given parameters n, k, q, and prescribed minimum distance of at least . Our approach is based on a function estimating the probability that a code of dimension and blocklength over is extendable to a code with the given properties. Combining this evaluation function with a search algorithm, we were able to improve 40 entries in the international tables for the best known minimum distance in the cases and found at least two new optimal linear codes.
Keywords :
estimation theory; linear codes; probability; search problems; heuristic algorithm; optimal linear code construction; probability estimation function; search algorithm; Error correction codes; Galois fields; Geometry; Hamming distance; Heuristic algorithms; Linear code; Upper bound; Vectors; Coding theory; extension; heuristic algorithm; high minimum distance; linear codes; weight distribution;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2008.920323
