Related papers: Good cyclic codes and the uncertainty principle

Let $G$ be a finite abelian group, and let $f: G \to \C$ be a complex function on $G$. The uncertainty principle asserts that the support $\supp(f) := \{x \in G: f(x) \neq 0\}$ is related to the support of the Fourier transform $\hat f: G…

A well-known version of the uncertainty principle on the cyclic group $\mathbb{Z}_N$ states that for any couple of functions $f,g\in\ell^2(\mathbb{Z}_N)\setminus\{0\}$, the short-time Fourier transform $V_g f$ has support of cardinality at…

The classical uncertainty principle of harmonic analysis states that a nontrivial function and its Fourier transform cannot both be sharply localized. It plays an important role in signal processing and physics. This paper generalizes the…

Let $f$ be a finite signal. The classical uncertainty principle tells us that the product of the support of $f$ and the support of $\hat{f}$, the Fourier transform of $f$, must satisfy $|supp(f)|\cdot|supp(\hat{f})|\geq |G|$. Recently,…

We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…

We show that a well known uncertainty principle for functions on the circle can be derived from an uncertainty principle for the Euclidean motion group.

In this paper we study the uncertainty principle (UP) connecting a function over a finite field and its Mattson-Solomon polynomial, which is a kind of Fourier transform in positive characteristic. Three versions of the UP over finite fields…

It is well known that if a function $f$ satisfies $$\|f(x) e^{\pi \alpha |x|^2}\|_p + \| \widehat{f}(\xi) e^{\pi \alpha |\xi|^2} \|_q<\infty \qquad\qquad\qquad(*)$$ with $\alpha=1$ and $1\le p,q<\infty$, then $f\equiv 0.$ We prove that if…

Classical and recent results on uncertainty principles for functions on finite Abelian groups relate the cardinality of the support of a function to the cardinality of the support of its Fourier transforms. We use these results and their…

The problem of identifying whether the family of cyclic codes is asymptotically good or not is a long-standing open problem in the field of coding theory. It is known in the literature that some families of cyclic codes such as BCH codes…

Let $G$ be a locally compact abelian group, and let $\widehat{G}$ denote its dual group, equipped with a Haar measure. A variant of the uncertainty principle states that for any $S \subset G$ and $\Sigma \subset \widehat{G}$, there exists a…

Long quasi-cyclic codes of any fixed index $>1$ have been shown to be asymptotically good, depending on Artin primitive root conjecture in (A. Alahmadi, C. G\"uneri, H. Shoaib, P. Sol\'e, 2017). We use this recent result to construct good…

We show how a number of well-known uncertainty principles for the Fourier transform, such as the Heisenberg uncertainty principle, the Donoho--Stark uncertainty principle, and Meshulam's non-abelian uncertainty principle, have little to do…

In the field of applied mathematics the Fourier transform has developed into an important tool. It is a powerful method for solving partial differential equations. The Fourier transform provides also a technique for signal analysis where…

Promoting a theory with a finite number of terms into an effective field theory with an infinite number of terms worsens simplicity, predictability, falsifiability, and other attributes often favored in theory choice. However, the…

A finite group with a cyclic normal subgroup N such that G/N is cyclic is said to be metacyclic. A code over a finite field F is a metacyclic code if it is a left ideal in the group algebra FG for G a metacyclic group. Metacyclic codes are…

For nonzero coprime integers $a$ and $b$, a positive integer $\ell$ is said to be \emph{good with respect to $a$ and $b$} if there exists a positive integer $k$ such that $\ell$ divides $a^{k} + b^{k}$. The concept of good integers has been…

List recovery is a fundamental task for error-correcting codes, vastly generalizing unique decoding from worst-case errors and list decoding. Briefly, one is given ''soft information'' in the form of input lists S_1,...,S_n of bounded size,…

Analytic number theorists usually seek to show that sequences which appear naturally in arithmetic are ``well-distributed'' in some appropriate sense. In various discrepancy problems, combinatorics researchers have analyzed limitations to…

We study the problem of empirical coordination subject to a fidelity criterion for a general set-up. We prove a result which indicates a strong connection between our framework and the framework of empirical coordination developed in [1].…