Minimum distance bounds for cyclic codes and Deligne's theorem (Q4307364)
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: Minimum distance bounds for cyclic codes and Deligne's theorem |
scientific article; zbMATH DE number 645394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum distance bounds for cyclic codes and Deligne's theorem |
scientific article; zbMATH DE number 645394 |
Statements
Minimum distance bounds for cyclic codes and Deligne's theorem (English)
0 references
3 October 1994
0 references
bounds for exponential sums in one and several variables
0 references
bounds on the minimum distance of cyclic codes
0 references
Deligne's theorem
0 references
generalized Reed- Muller codes
0 references
binary cyclic codes
0 references
0.8345396518707275
0 references
0.8311539888381958
0 references
0.8310276865959167
0 references
0.8237777948379517
0 references
