Paper Info
Title
An improvement of the asymptotic Elias bound for non-binary codes.
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...
Year
DOI
Venue
2018
10.1109/TIT.2018.2806968
IEEE Transactions on Information Theory
Keywords
DocType
Volume
Upper bound,Information rates,Indexes,Information theory,Education,Electronic mail
Journal
64
Issue
ISSN
Citations 
7
0018-9448
0
PageRank 
References 
Authors
0.34
2
1
Name
Order
Citations
PageRank
Krishna V. Kaipa1153.32