An Improvement of the Asymptotic Elias Bound for Non-Binary Codes
From MaRDI portal
Publication:4682826
DOI10.1109/TIT.2018.2806968zbMATH Open1401.94210arXiv1705.07785OpenAlexW2962898189MaRDI QIDQ4682826
Publication date: 19 September 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, 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.
Full work available at URL: https://arxiv.org/abs/1705.07785
Related Items (1)
This page was built for publication: An Improvement of the Asymptotic Elias Bound for Non-Binary Codes
