The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Livros de códigos com pequenas amplitudes máximas de correlação cruzada têm aplicações importantes em comunicação de acesso múltiplo por divisão de código (CDMA), teoria de codificação e detecção compactada. Nesta carta, projetamos um novo livro de códigos baseado na construção de grafos de Ramanujan sobre grupos abelianos finitos. Provamos que o novo livro de códigos com comprimento K=q+1 e tamanho N=q2+2q+2 é assintoticamente ideal, quase atingindo o limite de Levenshtein quando n=3, onde q é um poder primordial. Os parâmetros do novo livro de códigos são novos.
Zhangti YAN
Southwest Jiaotong University
Zhi GU
Southwest Jiaotong University
Wei GUO
Southwest Jiaotong University
Jianpeng WANG
Southwest Jiaotong University
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.
Copiar
Zhangti YAN, Zhi GU, Wei GUO, Jianpeng WANG, "A Construction of Codebooks Asymptotically Meeting the Levenshtein Bound" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 11, pp. 1513-1516, November 2022, doi: 10.1587/transfun.2021EAL2109.
Abstract: Codebooks with small maximal cross-correlation amplitudes have important applications in code division multiple access (CDMA) communication, coding theory and compressed sensing. In this letter, we design a new codebook based on a construction of Ramanujan graphs over finite abelian groups. We prove that the new codebook with length K=q+1 and size N=q2+2q+2 is asymptotically optimal with nearly achieving the Levenshtein bound when n=3, where q is a prime power. The parameters of the new codebook are new.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021EAL2109/_p
Copiar
@ARTICLE{e105-a_11_1513,
author={Zhangti YAN, Zhi GU, Wei GUO, Jianpeng WANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Construction of Codebooks Asymptotically Meeting the Levenshtein Bound},
year={2022},
volume={E105-A},
number={11},
pages={1513-1516},
abstract={Codebooks with small maximal cross-correlation amplitudes have important applications in code division multiple access (CDMA) communication, coding theory and compressed sensing. In this letter, we design a new codebook based on a construction of Ramanujan graphs over finite abelian groups. We prove that the new codebook with length K=q+1 and size N=q2+2q+2 is asymptotically optimal with nearly achieving the Levenshtein bound when n=3, where q is a prime power. The parameters of the new codebook are new.},
keywords={},
doi={10.1587/transfun.2021EAL2109},
ISSN={1745-1337},
month={November},}
Copiar
TY - JOUR
TI - A Construction of Codebooks Asymptotically Meeting the Levenshtein Bound
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1513
EP - 1516
AU - Zhangti YAN
AU - Zhi GU
AU - Wei GUO
AU - Jianpeng WANG
PY - 2022
DO - 10.1587/transfun.2021EAL2109
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2022
AB - Codebooks with small maximal cross-correlation amplitudes have important applications in code division multiple access (CDMA) communication, coding theory and compressed sensing. In this letter, we design a new codebook based on a construction of Ramanujan graphs over finite abelian groups. We prove that the new codebook with length K=q+1 and size N=q2+2q+2 is asymptotically optimal with nearly achieving the Levenshtein bound when n=3, where q is a prime power. The parameters of the new codebook are new.
ER -