English

The shift bound for abelian codes and generalizations of the Donoho-Stark uncertainty principle

Combinatorics 2018-04-03 v1

Abstract

Let GG be a finite abelian group. If f:G\bCf: G\rightarrow \bC is a nonzero function with Fourier transform \hf\hf, the Donoho-Stark uncertainty principle states that \supp(f)\supp(\hf)G|\supp(f)||\supp(\hf)|\geq |G|. The purpose of this paper is twofold. First, we present the shift bound for abelian codes with a streamlined proof. Second, we use the shifting technique to prove a generalization and a sharpening of the Donoho-Stark uncertainty principle. In particular, the sharpened uncertainty principle states, with notation above, that \supp(f)\supp(\hf)G+\supp(f)H(\supp(f))|\supp(f)||\supp(\hf)|\geq |G|+|\supp(f)|-|H(\supp(f))|, where H(\supp(f))H(\supp(f)) is the stabilizer of \supp(f)\supp(f) in GG.

Keywords

Cite

@article{arxiv.1804.00367,
  title  = {The shift bound for abelian codes and generalizations of the Donoho-Stark uncertainty principle},
  author = {Tao Feng and Henk D. L. Hollmann and Qing Xiang},
  journal= {arXiv preprint arXiv:1804.00367},
  year   = {2018}
}

Comments

14 pages, submitted