More constructions of near optimal codebooks associated with binary sequences
From MaRDI portal
(Redirected from Publication:514537)
Recommendations
- Two classes of near-optimal codebooks with respect to the Welch bound
- Two constructions of asymptotically optimal codebooks according to the Welch bound
- Constructions of some classes of codebooks nearly meeting the Welch bound
- Two families of nearly optimal codebooks
- Generalized asymptotically optimal codebooks
Cites work
- scientific article; zbMATH DE number 1284434 (Why is no real title available?)
- scientific article; zbMATH DE number 1740059 (Why is no real title available?)
- A Construction of Codebooks Associated With Binary Sequences
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- A new characterization of semi-bent and bent functions on finite fields
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- Achieving the Welch Bound With Difference Sets
- Binary sequences with Gold-like correlation but larger linear span
- Codebooks from almost difference sets
- Complex Codebooks From Combinatorial Designs
- Construction of cyclotomic codebooks nearly meeting the Welch bound
- Gold and Kasami-Welch functions, quadratic forms, and bent functions
- Grassmannian frames with applications to coding and communication
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
- New cyclic difference sets with Singer parameters
- New nearly optimal codebooks from relative difference sets
- On Bent and Semi-Bent Quadratic Boolean Functions
- On Cryptosystems Based on Polynomials and Finite Fields
- On ``bent functions
- On semi-bent functions and related plateaued functions over the Galois field \(\mathbb{F}_{2^n}\)
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Spherical codes and designs
- Steiner equiangular tight frames
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- Two Classes of Codebooks Nearly Meeting the Welch Bound
Cited in
(6)- 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
- Two classes of near-optimal codebooks with respect to the Welch bound
- Partial Fourier codebooks associated with multiplied Golay complementary sequences for compressed sensing
- Character sums over a non-chain ring and their applications
- Two constructions of asymptotically optimal codebooks
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)