A Heuristic Algorithm for the Construction of Good Linear Codes
Johannes Zwanzger ;
IEEE Transactions on Information Theory, ISBN/ISSN/ISMV Nummer:0018-9448
in: IEEE Transactions on Information Theory, Jg.:2008, Bd.:54, Hnr.: 5, S.: 2388 - 2392 Doi-Nummer:
In this correspondence we describe a heuristic method for the construction of linear codes with given parameters n, k, q and a prescribed minimum distance of at least d. Our approach is based on a function estimating the probability that a code of dimension k and blocklength n' < n over GF(q) 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 q=2, 5, 7, 9 and found at least two new optimal linear codes.