1. Digital Repository at Indian Institute of Science Education and Research Pune
  2. PUBLICATIONS & PATENTS
  3. JOURNAL ARTICLES
Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3354
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKAIPA, KRISHNAen_US
dc.date.accessioned2019-07-01T05:37:43Z
dc.date.available2019-07-01T05:37:43Z
dc.date.issued2017-08en_US
dc.identifier.citationIEEE Transactions on Information Theory, 63(8), 4940 - 4948.en_US
dc.identifier.issn0018-9448en_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3354-
dc.identifier.urihttps://doi.org/10.1109/TIT.2017.2706677en_US
dc.description.abstractWe study the problem of classifying deep holes of Reed-Solomon codes. We show that this problem is equivalent to the problem of classifying maximum distance separable (MDS) extensions of Reed-Solomon codes by one digit. This equivalence allows us to improve recent results on the former problem. In particular, we classify deep holes of Reed-Solomon codes of dimension greater than half the alphabet size. We also give a complete classification of deep holes of Reed-Solomon codes with redundancy three in all dimensions.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectReed-Solomon codesen_US
dc.subjectGeneratorsen_US
dc.subjectParity checkcodesen_US
dc.subjectStandardsen_US
dc.subjectRedundancyen_US
dc.subjectGeometryen_US
dc.subjectTerminologyen_US
dc.subject2017en_US
dc.titleDeep Holes and MDS Extensions of Reed-Solomon Codesen_US
dc.typeArticleen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.identifier.sourcetitleIEEE Transactions on Information Theoryen_US
dc.publication.originofpublisherForeignen_US
Appears in Collections:JOURNAL ARTICLES

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


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