Please use this identifier to cite or link to this item:
|Title:||The weights in MDS codes|
|Source:||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|
|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.|
|Source Title:||IEEE Transactions on Information Theory|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 15, 2018
WEB OF SCIENCETM
checked on Feb 5, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.