For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Family of Codebooks with Nearly Optimal Set Size
Cuiling FAN Rong LUO Xiaoni DU
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2016/05/01
Online ISSN: 1745-1337
Type of Manuscript: LETTER
Category: Coding Theory
codebook, signal set, Levenstein bound, CDMA, compressed sensing,
Full Text: PDF>>
Codebooks with good parameters are preferred in many practical applications, such as direct spread CDMA communications and compressed sensing. In this letter, an upper bound on the set size of a codebook is introduced by modifying the Levenstein bound on the maximum amplitudes of such a codebook. Based on an estimate of a class of character sums over a finite field by Katz, a family of codebooks nearly meeting the modified bound is proposed.