Good cyclic codes and the uncertainty principle
Information Theory
2017-04-19 v2 math.IT
Number Theory
Representation Theory
Abstract
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 on some abelian group, either or its Fourier transform 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.
Keywords
Cite
@article{arxiv.1703.01080,
title = {Good cyclic codes and the uncertainty principle},
author = {Shai Evra and Emmanuel Kowalski and Alexander Lubotzky},
journal= {arXiv preprint arXiv:1703.01080},
year = {2017}
}
Comments
20 pages