1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISIT.2012.6283537
DC FieldValue
dc.titleComputing extensions of linear codes using a greedy algorithm
dc.contributor.authorGrassl, M.
dc.contributor.authorHan, S.
dc.date.accessioned2014-11-28T05:02:40Z
dc.date.available2014-11-28T05:02:40Z
dc.date.issued2012
dc.identifier.citationGrassl, 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. <a href="https://doi.org/10.1109/ISIT.2012.6283537" target="_blank">https://doi.org/10.1109/ISIT.2012.6283537</a>
dc.identifier.isbn9781467325790
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/112547
dc.description.abstractThis 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISIT.2012.6283537
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCENTRE FOR QUANTUM TECHNOLOGIES
dc.description.doi10.1109/ISIT.2012.6283537
dc.description.sourcetitleIEEE International Symposium on Information Theory - Proceedings
dc.description.page1568-1572
dc.description.codenPISTF
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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