Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/5227Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | KAIPA, KRISHNA | en_US |
| dc.date.accessioned | 2020-10-20T07:07:33Z | |
| dc.date.available | 2020-10-20T07:07:33Z | |
| dc.date.issued | 2014-11 | en_US |
| dc.identifier.citation | IEEE Transactions on Information Theory, 60(11), 7047-7057. | en_US |
| dc.identifier.issn | 0018-9448 | en_US |
| dc.identifier.issn | 1557-9654 | en_US |
| dc.identifier.uri | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/5227 | - |
| dc.identifier.uri | https://doi.org/10.1109/TIT.2014.2349903 | en_US |
| dc.description.abstract | We obtain an asymptotic formula in q, as well as new upper and lower bounds, for the number of MDS codes of length n and dimension k over a finite field with q elements. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE | en_US |
| dc.subject | MDS codes | en_US |
| dc.subject | Grassmannian | en_US |
| dc.subject | 2014 | en_US |
| dc.title | An Asymptotic Formula in q for the Number of [n, k] q-Ary MDS Codes | en_US |
| dc.type | Article | en_US |
| dc.contributor.department | Dept. of Mathematics | en_US |
| dc.identifier.sourcetitle | IEEE Transactions on Information Theory | en_US |
| dc.publication.originofpublisher | Foreign | en_US |
| Appears in Collections: | JOURNAL ARTICLES | |
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.