Please use this identifier to cite or link to this item:
|Title:||Computing extensions of linear codes using a greedy algorithm|
|Authors:||Grassl, M. |
|Source:||Grassl, M.,Han, S. (2012). Computing extensions of linear codes using a greedy algorithm. IEEE International Symposium on Information Theory - Proceedings : 1568-1572. ScholarBank@NUS Repository. https://doi.org/10.1109/ISIT.2012.6283537|
|Abstract:||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. We present a simple greedy algorithm which surprisingly yields many codes improving the previously known lower bounds on the minimum distance. We also discuss variations of the algorithm that succeed when the greedy algorithm is not feasible or fails. © 2012 IEEE.|
|Source Title:||IEEE International Symposium on Information Theory - Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 12, 2018
checked on Feb 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.