Minimum distance bounds for cyclic codes and Deligne's theorem (Q4307364): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/18.259637 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2171635774 / rank | |||
Normal rank | |||
Latest revision as of 20:05, 19 March 2024
scientific article; zbMATH DE number 645394
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
