Codebooks from generalized bent Z₄-valued quadratic forms

From MaRDI portal
Publication:2286597

DOI10.1016/J.DISC.2019.111736zbMATH Open1487.94200arXiv1905.08834OpenAlexW2947214501MaRDI QIDQ2286597FDOQ2286597


Authors: Yanfeng Qi, Sihem Mesnager, Chun-Ming Tang Edit this on Wikidata


Publication date: 22 January 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Codebooks with small inner-product correlation have application in unitary space-time modulations, multiple description coding over erasure channels, direct spread code division multiple access communications, compressed sensing, and coding theory. It is interesting to construct codebooks (asymptotically) achieving the Welch bound or the Levenshtein bound. This paper presented a class of generalized bent mathbbZ4-valued quadratic forms, which contain functions of Heng and Yue (Optimal codebooks achieving the Levenshtein bound from generalized bent functions over mathbbZ4. Cryptogr. Commun. 9(1), 41-53, 2017). By using these generalized bent mathbbZ4-valued quadratic forms, we constructs optimal codebooks achieving the Levenshtein bound. These codebooks have parameters (22m+2m,2m) and alphabet size 6.


Full work available at URL: https://arxiv.org/abs/1905.08834




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286597)