More constructions of near optimal codebooks associated with binary sequences

DOI10.3934/AMC.2017012zbMATH Open1357.94080OpenAlexW2588577247MaRDI QIDQ514537FDOQ514537

Xiyong Zhang, Wun-Seng Chou, Xiwang Cao

Publication date: 9 March 2017

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2017012

zbMATH Keywords

codebookFourier matrixcharacter sumHadamard matrixWelch bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• On ``bent functions
• Grassmannian frames with applications to coding and communication
• A new characterization of semi-bent and bent functions on finite fields
• On Bent and Semi-Bent Quadratic Boolean Functions
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
• New cyclic difference sets with Singer parameters
• The weights of the orthogonals of the extended quadratic binary Goppa codes
• Spherical codes and designs
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• On Semi-bent Functions and Related Plateaued Functions Over the Galois Field 𝔽 2 n $$\mathbb{F}_{2^{n}}$$
• Steiner equiangular tight frames
• Achieving the Welch Bound With Difference Sets
• Title not available (Why is that?)
• On Cryptosystems Based on Polynomials and Finite Fields
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Complex Codebooks From Combinatorial Designs
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Binary sequences with Gold-like correlation but larger linear span
• Two Classes of Codebooks Nearly Meeting the Welch Bound
• Gold and Kasami-Welch functions, quadratic forms, and bent functions
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• Codebooks from almost difference sets
• A new class of near-optimal partial Fourier codebooks from an almost difference set
• Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
• A Construction of Codebooks Associated With Binary Sequences
• New nearly optimal codebooks from relative difference sets

Cited In (5)

• Two classes of near-optimal codebooks with respect to the Welch bound
• Character sums over a non-chain ring and their applications
• Two constructions of asymptotically optimal codebooks
• Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
• Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications

This page was built for publication: More constructions of near optimal codebooks associated with binary sequences

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