Back to Search
Start Over
New Families of Codebooks Achieving the Levenstein Bound.
- Source :
-
IEEE Transactions on Information Theory . Nov2014, Vol. 60 Issue 11, p7382-7387. 6p. - Publication Year :
- 2014
-
Abstract
- In this paper, a construction of codebooks based on a set of bent functions satisfying certain conditions is introduced. It includes some earlier constructions of codebooks meeting the Levenstein bound as special cases. With this construction, two new families of codebooks achieving the Levenstein bound are obtained. The codebooks constructed in this paper could have a very small alphabet size. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 60
- Issue :
- 11
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 99041669
- Full Text :
- https://doi.org/10.1109/TIT.2014.2353052