Nearly optimal codebooks based on generalized Jacobi sums (Q1801063): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1705.08055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Z<sub>4</sub> -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Lines, Planes, etc.: Packings in Grassmannian Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of the Welch bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of<i>k</i>-Angle Tight Frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex Codebooks From Combinatorial Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generic Construction of Complex Codebooks Meeting the Welch Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equiangular Tight Frames From Hyperovals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner equiangular tight frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantized frame expansions with erasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systematic design of unitary space-time constellations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3665801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two families of nearly optimal codebooks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Sensing Matrices Arising From Near Orthogonal Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grassmannian beamforming for multiple-input multiple-output wireless systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On beamforming with finite rate feedback in multiple-antenna systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4330648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grassmannian frames with applications to coding and communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of equiangular tight frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and construction of noncoherent unitary space-time codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the maximum cross correlation of signals (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving the Welch Bound With Difference Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of near-optimal partial Fourier codebooks from an almost difference set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Classes of Codebooks Nearly Meeting the Welch Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Families of Codebooks Achieving the Levenstein Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: New nearly optimal codebooks from relative difference sets / rank
 
Normal rank

Latest revision as of 02:19, 17 July 2024

scientific article
Language Label Description Also known as
English
Nearly optimal codebooks based on generalized Jacobi sums
scientific article

    Statements

    Nearly optimal codebooks based on generalized Jacobi sums (English)
    0 references
    0 references
    26 October 2018
    0 references
    code division multiple access
    0 references
    codebooks
    0 references
    signal sets
    0 references
    compressed sensing
    0 references
    Welch bound
    0 references
    Levenshtein bound
    0 references
    0 references
    0 references
    0 references

    Identifiers