Two classes of near-optimal codebooks with respect to the Welch bound
From MaRDI portal
Publication:2025366
DOI10.3934/amc.2020066zbMath1464.11139OpenAlexW3000721332MaRDI QIDQ2025366
Publication date: 12 May 2021
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020066
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Polynomials over finite fields (11T06) Exponential sums (11T23)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Linear codes with two or three weights from quadratic bent functions
- More constructions of near optimal codebooks associated with binary sequences
- New nearly optimal codebooks from relative difference sets
- Steiner equiangular tight frames
- Construction of cyclotomic codebooks nearly meeting the Welch bound
- Grassmannian frames with applications to coding and communication
- Binary linear codes with two or three weights from Niho exponents
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
- New Families of Codebooks Achieving the Levenstein Bound
- Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
- A Construction of Codebooks Associated With Binary Sequences
- Monomial and quadratic bent functions over the finite fields of odd characteristic
- Achieving the Welch Bound With Difference Sets
- Complex Codebooks From Combinatorial Designs
- Cyclotomic Linear Codes of Order $3$
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- The Geometry of Two-Weight Codes
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Symmetric informationally complete quantum measurements
- Two Classes of Codebooks Nearly Meeting the Welch Bound
- New Binomial Bent Functions Over the Finite Fields of Odd Characteristic
- Two constructions of approximately symmetric informationally complete positive operator-valued measures
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
This page was built for publication: Two classes of near-optimal codebooks with respect to the Welch bound
