Codebooks from generalized bent Z₄-valued quadratic forms

DOI10.1016/J.DISC.2019.111736MaRDI QIDQ2286597zbMATH OpenOpenAlexFDO

Authors Yanfeng Qi, Sihem Mesnager, Chun-Ming Tang

Publication date 22 January 2020

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

codebookquadratic formGalois ringgeneralized bent function

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Quadratic forms over local rings and fields (11E08) Boolean functions (94D10) Finite commutative rings (13M99)

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 $mathbb{Z}_4$-valued quadratic forms, which contain functions of Heng and Yue (Optimal codebooks achieving the Levenshtein bound from generalized bent functions over $mathbb{Z}_4$. Cryptogr. Commun. 9(1), 41-53, 2017). By using these generalized bent $mathbb{Z}_4$-valued quadratic forms, we constructs optimal codebooks achieving the Levenshtein bound. These codebooks have parameters $(2^{2m}+2^m,2^m)$ and alphabet size $6$.

Recommendations

• Two Classes of Quaternary Codes from Z 4 -valued Quadratic Forms
• Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
• Several Classes of Codes and Sequences Derived From a $\BBZ_{4}$-Valued Quadratic Form
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• Type IV-II codes over \(\mathbb{Z}_4\) constructed from generalized bent functions
• Vectorial bent functions and linear codes from quadratic forms
• A class of quadratic forms and the associated few-weight codes
• scientific article; zbMATH DE number 5592915
• Quadratic residue codes over $\mathbb Z_4 + u_1 \mathbb Z_4 + \ldots + u_t \mathbb Z_4$ and quantum codes from these codes
• Quasi-cyclic codes over Z/sub 4/ and some new binary codes

Cites work

• scientific article; zbMATH DE number 3818560 (Why is no real title available?)
• scientific article; zbMATH DE number 3460471 (Why is no real title available?)
• scientific article; zbMATH DE number 3633251 (Why is no real title available?)
• scientific article; zbMATH DE number 1284434 (Why is no real title available?)
• scientific article; zbMATH DE number 1740059 (Why is no real title available?)
• scientific article; zbMATH DE number 826047 (Why is no real title available?)
• scientific article; zbMATH DE number 7300366 (Why is no real title available?)
• ${\BBZ}_4$-Valued Quadratic Forms and Quaternary Sequence Families
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Achieving the Welch Bound With Difference Sets
• An introduction to frames and Riesz bases
• Bent functions. Fundamentals and results
• Codebooks from almost difference sets
• Complex Codebooks From Combinatorial Designs
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• Four decades of research on bent functions
• Gauss periods and codebooks from generalized cyclotomic sets of order four
• Generalizations of the Kervaire invariant
• Generalized Gray map and a class of p-ary nonlinear codes
• Grassmannian frames with applications to coding and communication
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Nearly optimal codebooks based on generalized Jacobi sums
• New Constructions of Quadratic Bent Functions in Polynomial Form
• New Families of Codebooks Achieving the Levenstein Bound
• New Optimal Quadriphase Sequences With Larger Linear Span
• New families of binary sequences with low correlation
• Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Steiner equiangular tight frames
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Two Classes of Codebooks Nearly Meeting the Welch Bound
• Two families of nearly optimal codebooks
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets

Cited in

(4)

• Two Classes of Quaternary Codes from Z 4 -valued Quadratic Forms
• Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• Cayley sum graphs and their applications to codebooks

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)