Two classes of near-optimal codebooks with respect to the Welch bound
From MaRDI portal
Publication:2025366
DOI10.3934/AMC.2020066zbMATH Open1464.11139OpenAlexW3000721332MaRDI QIDQ2025366FDOQ2025366
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
Recommendations
- Two Classes of Codebooks Nearly Meeting 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
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
- Two families of nearly optimal codebooks
- New constructions of codebooks nearly meeting the Welch bound
- Two constructions of asymptotically optimal codebooks
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Exponential sums (11T23)
Cites Work
- The Geometry of Two-Weight Codes
- Grassmannian frames with applications to coding and communication
- Monomial and quadratic bent functions over the finite fields of odd characteristic
- New Binomial Bent Functions Over the Finite Fields of Odd Characteristic
- A construction of binary linear codes from Boolean functions
- Cyclotomic Linear Codes of Order $3$
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Symmetric informationally complete quantum measurements
- Steiner equiangular tight frames
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Linear codes with two or three weights from quadratic bent functions
- Achieving the Welch Bound With Difference Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
- New Families of Codebooks Achieving the Levenstein Bound
- Complex Codebooks From Combinatorial Designs
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Title not available (Why is that?)
- Two Classes of Codebooks Nearly Meeting the Welch Bound
- Construction of cyclotomic codebooks nearly meeting the Welch bound
- 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
- More constructions of near optimal codebooks associated with binary sequences
- New nearly optimal codebooks from relative difference sets
- Binary linear codes with two or three weights from Niho exponents
- Two constructions of approximately symmetric informationally complete positive operator-valued measures
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
Cited In (5)
- Achieving the Welch Bound With Difference Sets
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Welch bound equality sets with few distinct inner products from Delsarte-Goethals sets
This page was built for publication: Two classes of near-optimal codebooks with respect to the Welch bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025366)
