Nearly optimal codebooks based on generalized Jacobi sums (Q1801063)

From MaRDI portal
Revision as of 02:19, 17 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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