The shift bound for abelian codes and generalizations of the Donoho-Stark uncertainty principle
Tao Feng, Henk D. L. Hollmann, Qing Xiang

TL;DR
This paper introduces the shift bound for abelian codes and extends the Donoho-Stark uncertainty principle, providing a sharper inequality involving the support of functions and their Fourier transforms on finite abelian groups.
Contribution
It presents a streamlined proof of the shift bound for abelian codes and generalizes the Donoho-Stark uncertainty principle with a sharper bound using shifting techniques.
Findings
Established the shift bound for abelian codes.
Proved a generalized uncertainty principle with a new lower bound.
Sharpened the classical Donoho-Stark inequality for finite abelian groups.
Abstract
Let be a finite abelian group. If is a nonzero function with Fourier transform , the Donoho-Stark uncertainty principle states that . 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 , where is the stabilizer of in .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Mathematical Analysis and Transform Methods · graph theory and CDMA systems
