IEICE TRANSACTIONS on Fundamentals
A Family of Codebooks with Nearly Optimal Set Size
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.5 pp.994-997
- Publication Date
- 2016/05/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E99.A.994
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Cuiling FAN
Southwest Jiaotong University
Rong LUO
Southwest Jiaotong University
Xiaoni DU
Northwest Normal University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Cuiling FAN, Rong LUO, Xiaoni DU, "A Family of Codebooks with Nearly Optimal Set Size" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 5, pp. 994-997, May 2016, doi: 10.1587/transfun.E99.A.994.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.994/_p
Copy
@ARTICLE{e99-a_5_994,
author={Cuiling FAN, Rong LUO, Xiaoni DU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Family of Codebooks with Nearly Optimal Set Size},
year={2016},
volume={E99-A},
number={5},
pages={994-997},
abstract={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.},
keywords={},
doi={10.1587/transfun.E99.A.994},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - A Family of Codebooks with Nearly Optimal Set Size
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 994
EP - 997
AU - Cuiling FAN
AU - Rong LUO
AU - Xiaoni DU
PY - 2016
DO - 10.1587/transfun.E99.A.994
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2016
AB - 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.
ER -
English
