Codes by Kohnert and Zwanzger

In [1] and other forthcoming papers, new projective codes over F2, F3, F4, F5, and F7 are found using an heuristic algorithm. Starting with s0 points in the projective space PG(n−1, b), ss0 additional points are added in order to obtain an [s, n, d]-code. The heuristic method is used for checking only a small number of possible points for the extension.

References

[1]Axel Kohnert and Johannes Zwanzger.
Heuristic methods for the construction of optimal codes, September 2007.
Preprint.

Copyright

Copyright © 2004, 2005, 2006, 2007, 2008, 2009, 2010 by Rudolf Schürer and Wolfgang Ch. Schmid.
Cite this as: Rudolf Schürer and Wolfgang Ch. Schmid. “Codes by Kohnert and Zwanzger.” From MinT—the database of optimal net, code, OA, and OOA parameters. Version: 2008-04-04. http://mint.sbg.ac.at/desc_CKohnertZwanzger.html

Show usage of this method