Good cyclic codes and the uncertainty principle (Q1624913)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6980528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Good cyclic codes and the uncertainty principle |
scientific article; zbMATH DE number 6980528 |
Statements
Good cyclic codes and the uncertainty principle (English)
0 references
16 November 2018
0 references
Summary: A long standing problem in the area of error correcting codes asks whether there exist good cyclic codes. Most of the known results point in the direction of a negative answer.{ }The uncertainty principle is a classical result of harmonic analysis asserting that given a non-zero function \(f\) on some abelian group, either \(f\) or its Fourier transform \(\hat{f}\) has large support.{ }In this note, we observe a connection between these two subjects. We point out that even a weak version of the uncertainty principle for fields of positive characteristic would imply that good cyclic codes do exist. We also provide some heuristic arguments supporting that this is indeed the case.
0 references
cyclic codes
0 references
uncertainty principles
0 references
finite abelian groups
0 references
primitive roots
0 references
Artin conjecture
0 references
0.8668121695518494
0 references
0.757637083530426
0 references
0.7346327304840088
0 references
0.7320535182952881
0 references
0.7227747440338135
0 references