Deep Holes and MDS Extensions of Reed-Solomon Codes

dc.contributor.author	KAIPA, KRISHNA	en_US
dc.date.accessioned	2019-07-01T05:37:43Z
dc.date.available	2019-07-01T05:37:43Z
dc.date.issued	2017-08	en_US
dc.identifier.citation	IEEE Transactions on Information Theory, 63(8), 4940 - 4948.	en_US
dc.identifier.issn	0018-9448	en_US
dc.identifier.uri	http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3354
dc.identifier.uri	https://doi.org/10.1109/TIT.2017.2706677	en_US
dc.description.abstract	We 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.iso	en	en_US
dc.publisher	IEEE	en_US
dc.subject	Reed-Solomon codes	en_US
dc.subject	Generators	en_US
dc.subject	Parity checkcodes	en_US
dc.subject	Standards	en_US
dc.subject	Redundancy	en_US
dc.subject	Geometry	en_US
dc.subject	Terminology	en_US
dc.subject	2017	en_US
dc.title	Deep Holes and MDS Extensions of Reed-Solomon 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