Nearly optimal codebooks based on generalized Jacobi sums (Q1801063): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 08:56, 1 February 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
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