Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISIT.2012.6283537
Title: Computing extensions of linear codes using a greedy algorithm
Authors: Grassl, M. 
Han, S.
Issue Date: 2012
Citation: 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
URI: http://scholarbank.nus.edu.sg/handle/10635/112547
ISBN: 9781467325790
DOI: 10.1109/ISIT.2012.6283537
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Nov 16, 2018

Page view(s)

32
checked on Nov 16, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.