IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508

この記事には本公開記事があります。本公開記事を参照してください。
引用する場合も本公開記事を引用してください。

A construction of codebooks asymptotically meeting the Levenshtein bound
Zhangti YANZhi GUWei GUOJianpeng WANG
著者情報
ジャーナル フリー 早期公開

論文ID: 2021EAL2109

この記事には本公開記事があります。
詳細
抄録

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.

著者関連情報
© 2022 The Institute of Electronics, Information and Communication Engineers
feedback
Top