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.
| Original language | English |
|---|---|
| Article number | 7293184 |
| Pages (from-to) | 6526-6535 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 61 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - Dec 2015 |
Bibliographical note
Publisher Copyright:© 2015 IEEE.
Keywords
- Codebooks
- Levenshtein bounds
- bent functions
- codes
- semi-bent functions
- signal sets