Internet Archive Scholar

Computing Extensions of Linear Codes

Markus Grassl
2007 2007 IEEE International Symposium on Information Theory  

Preserved Fulltext

File Archive PDF (115.4 kB)
https://archive.org/download/arxiv-0704.2596/0704.2596.pdf

The Internet Archive has a preservation copy of this work in our general collections. The file type is application/pdf.

Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:

2007 pre-print arXiv:0704.2596v1 fatcat:jlaqxknk5zdo5fuazpih6pvvce
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the previously known lower bounds on the minimum distance have been found.
doi:10.1109/isit.2007.4557095 dblp:conf/isit/Grassl07 fatcat:e3reomjjsfh7phcwxoqwug3idu
Multiple Versions
Citation

Markus Grassl. "Computing Extensions of Linear Codes." 2007 IEEE International Symposium on Information Theory (2007) 476-480