1. Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound.
- Author
-
Xiang, Can, Ding, Cunsheng, and Mesnager, Sihem
- Subjects
- *
BINARY codes , *MATHEMATICAL bounds , *SET theory , *HAMMING distance , *MULTIPLE access protocols (Computer network protocols) - Abstract
In this paper, a generic construction of codebooks based on binary codes is introduced. With this generic construction, a few previous constructions of optimal codebooks are extended, and a new class of codebooks almost meeting the Levenshtein bound is presented. Exponentially many codebooks meeting or almost meeting the Levenshtein bound from binary codes are obtained in this paper. The codebooks constructed in this paper have alphabet size 4. As a byproduct, three bounds on the parameters of binary codes are derived. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF