Please use this identifier to cite or link to this item:
https://doi.org/10.1109/TIT.2010.2090246
DC Field | Value | |
---|---|---|
dc.title | The weights in MDS codes | |
dc.contributor.author | Ezerman, M.F. | |
dc.contributor.author | Grassl, M. | |
dc.contributor.author | Sole, P. | |
dc.date.accessioned | 2014-12-12T07:52:29Z | |
dc.date.available | 2014-12-12T07:52:29Z | |
dc.date.issued | 2011-01 | |
dc.identifier.citation | Ezerman, M.F., Grassl, M., Sole, P. (2011-01). The weights in MDS codes. IEEE Transactions on Information Theory 57 (1) : 392-396. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2010.2090246 | |
dc.identifier.issn | 00189448 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/116650 | |
dc.description.abstract | The weights in maximum distance separable (MDS) codes of length n and dimension k over the finite field GF(q) are studied. Up to some explicit exceptional cases, the MDS codes with parameters given by the MDS conjecture are shown to contain all k weights in the range n-k to n. The proof uses the covering radius of the dual code. © 2006 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TIT.2010.2090246 | |
dc.source | Scopus | |
dc.subject | Covering radius | |
dc.subject | MDS codes | |
dc.subject | quantum codes | |
dc.subject | weight distribution | |
dc.type | Article | |
dc.contributor.department | CENTRE FOR QUANTUM TECHNOLOGIES | |
dc.description.doi | 10.1109/TIT.2010.2090246 | |
dc.description.sourcetitle | IEEE Transactions on Information Theory | |
dc.description.volume | 57 | |
dc.description.issue | 1 | |
dc.description.page | 392-396 | |
dc.description.coden | IETTA | |
dc.identifier.isiut | 000285842100027 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.