Nearly optimal codebooks based on generalized Jacobi sums (Q1801063)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nearly optimal codebooks based on generalized Jacobi sums |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0.8760825395584106
0 references
0.866228461265564
0 references
0.84883713722229
0 references
0.8478507995605469
0 references
0.8360928893089294
0 references
