More constructions of near optimal codebooks associated with binary sequences
From MaRDI portal
Publication:514537
DOI10.3934/amc.2017012zbMath1357.94080OpenAlexW2588577247MaRDI QIDQ514537
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
Related Items (5)
Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) ⋮ Character sums over a non-chain ring and their applications ⋮ Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications ⋮ Two classes of near-optimal codebooks with respect to the Welch bound ⋮ Two constructions of asymptotically optimal codebooks
Cites Work
- Unnamed Item
- Unnamed Item
- New cyclic difference sets with Singer parameters
- Gold and Kasami-Welch functions, quadratic forms, and bent functions
- New nearly optimal codebooks from relative difference sets
- Steiner equiangular tight frames
- Construction of cyclotomic codebooks nearly meeting the Welch bound
- Codebooks from almost difference sets
- On ``bent functions
- Spherical codes and designs
- Grassmannian frames with applications to coding and communication
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- A new characterization of semi-bent and bent functions on finite fields
- Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
- A Construction of Codebooks Associated With Binary Sequences
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- On Bent and Semi-Bent Quadratic Boolean Functions
- Achieving the Welch Bound With Difference Sets
- Complex Codebooks From Combinatorial Designs
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- On Cryptosystems Based on Polynomials and Finite Fields
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Binary sequences with Gold-like correlation but larger linear span
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- On Semi-bent Functions and Related Plateaued Functions Over the Galois Field 𝔽 2 n $$\mathbb{F}_{2^{n}}$$
- Two Classes of Codebooks Nearly Meeting the Welch Bound
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
This page was built for publication: More constructions of near optimal codebooks associated with binary sequences
