Optimal codebooks achieving the Levenshtein bound from generalized bent functions over Z₄

DOI10.1007/S12095-016-0194-5MaRDI QIDQ502403zbMATH OpenOpenAlexFDO

Authors Ziling Heng, Qin Yue

Publication date 5 January 2017

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12095-016-0194-5

zbMATH Keywords

generalized bent functionscodebooksLevenstein boundssignal sets

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Boolean functions (94D10)

Recommendations

• Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
• New constructions of codebooks nearly meeting the Welch bound
• Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
• Generalized asymptotically optimal codebooks
• Constructions of some classes of codebooks nearly meeting the Welch bound

Cites work

• scientific article; zbMATH DE number 3818560 (Why is no real title available?)
• scientific article; zbMATH DE number 3633251 (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
• Codes with the same weight distributions as the Goethals codes and the Delsarte-Goethals codes
• 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.)
• 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
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• 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

(12)

• Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
• Two constructions of asymptotically optimal codebooks according to the Welch bound
• Bent Functions and Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA
• New constructions of codebooks nearly meeting the Welch bound
• Character sums over a non-chain ring and their applications
• Hybrid character sums and near-optimal partial Hadamard codebooks
• Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
• A further construction of asymptotically optimal codebooks with multiplicative characters
• Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
• Nearly optimal codebooks based on generalized Jacobi sums
• Refining the search space of Alltop monomials
• Properties of tight frames that are regular schemes

This page was built for publication: Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)

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