1. An Improvement of the Asymptotic Elias Bound for Non-Binary Codes.
- Author
-
Kaipa, Krishna
- Subjects
- *
INFORMATION theory , *ASYMPTOTIC expansions , *ELIAS (Information retrieval system) , *CODING theory , *MATHEMATICAL bounds - 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. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF