Digital Repository

An Improvement of the Asymptotic Elias Bound for Non-Binary Codes

Show simple item record

dc.contributor.author KAIPA, KRISHNA en_US
dc.date.accessioned 2018-06-28T06:20:55Z
dc.date.available 2018-06-28T06:20:55Z
dc.date.issued 2018-07 en_US
dc.identifier.citation IEEE Transactions on Information Theory. Vol. 64(7). en_US
dc.identifier.issn 1557-9654 en_US
dc.identifier.uri http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/1075
dc.identifier.uri https://doi.org/10.1109/TIT.2018.2806968 en_US
dc.description.abstract For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low-relative minimum distance, whereas the Plotkin bound is better at high-relative minimum distance. In this paper, we obtain a hybrid of these bounds, which improves both. This in turn is based on the anticode bound, which is a hybrid of the Hamming and Singleton bounds and improves both bounds. The question of convexity of the asymptotic rate function is an important open question. We conjecture a much weaker form of the convexity, and we show that our bounds follow immediately if we assume the conjecture. en_US
dc.language.iso en en_US
dc.publisher IEEE en_US
dc.subject Asymptotic Elias Bound en_US
dc.subject Mathemaitcs en_US
dc.subject TOC-JUNE-2018 en_US
dc.subject 2018 en_US
dc.title An Improvement of the Asymptotic Elias Bound for Non-Binary 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


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Repository


Advanced Search

Browse

My Account