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

DOI10.1007/S12095-016-0194-5zbMATH Open1380.94154OpenAlexW2465189940MaRDI QIDQ502403FDOQ502403

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

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

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)

Cites Work

• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• An introduction to frames and Riesz bases
• Grassmannian frames with applications to coding and communication
• Bent functions. Fundamentals and results
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• New Constructions of Quadratic Bent Functions in Polynomial Form
• Achieving the Welch Bound With Difference Sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Title not available (Why is that?)
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
• Codes with the same weight distributions as the Goethals codes and the Delsarte-Goethals codes
• Two families of nearly optimal codebooks
• Gauss periods and codebooks from generalized cyclotomic sets of order four
• Generalizations of the Kervaire invariant
• Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
• New Families of Codebooks Achieving the Levenstein Bound
• New families of binary sequences with low correlation
• Complex Codebooks From Combinatorial Designs
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Title not available (Why is that?)
• ${\BBZ}_4$-Valued Quadratic Forms and Quaternary Sequence Families
• New Optimal Quadriphase Sequences With Larger Linear Span
• Two Classes of Codebooks Nearly Meeting the Welch Bound
• Generalized Gray map and a class of \(p\)-ary nonlinear codes
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• Four decades of research on bent functions

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)