Related papers: Good cyclic codes and the uncertainty principle
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(x^n-1), where F is a finite field. If this automorphism itself has certain specific cyclicity properties one is lead to the class of…
Encoding quantum information in a quantum error correction (QEC) code offers protection against decoherence and enhances the fidelity of qubits and gate operations. One of the fundamental challenges of QEC is to construct codes with…
This is a manuscript of a chapter prepared for a book. The good codes possess large information length and large minimum distance. A class of codes is said to be asymptotically good if there exists a positive real $\delta$ such that, for…
This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…
Let G be a finite abelian group of order n. For a complex valued function f on G, let \fht denote the Fourier transform of f. The uncertainty inequality asserts that if f \neq 0 then |supp(f)| |supp(\fht)| \geq n. Answering a question of…
We study the channel coding problem when errors and uncertainty occur in the encoding process. For simplicity we assume the channel between the encoder and the decoder is perfect. Focusing on linear block codes, we model the encoding…
Let $G$ be a finite abelian group. If $f: G\rightarrow \bC$ is a nonzero function with Fourier transform $\hf$, the Donoho-Stark uncertainty principle states that $|\supp(f)||\supp(\hf)|\geq |G|$. The purpose of this paper is twofold.…
Cyclic codes have many applications in consumer electronics, communication and data storage systems due to their efficient encoding and decoding algorithms. An efficient approach to constructing cyclic codes is the sequence approach. In…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
We consider the task of verifying the correctness of quantum computation for a restricted class of circuits which contain at most two basis changes. This contains circuits giving rise to the second level of the Fourier Hierarchy, the lowest…
The uncertainty principle constitutes one of the famous physical concepts which continues to attract researchers from different related fields since its discovery due to its utility in many applications. Among the classical (Fourier-based)…
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…
This report continues the discussion of unitary error bases and quantum codes begun in "Non-binary Unitary Error Bases and Quantum Codes". Nice error bases are characterized in terms of the existence of certain characters in a group. A…
A (left) group code of length n is a linear code which is the image of a (left) ideal of a group algebra via an isomorphism from FG to Fn which maps G to the standard basis of Fn. Many classical linear codes have been shown to be group…
A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how…
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…
Stabilizer codes form an important class of quantum error correcting codes which have an elegant theory, efficient error detection, and many known examples. Constructing stabilizer codes of length $n$ is equivalent to constructing subspaces…
We prove an optimal bound in twelve dimensions for the uncertainty principle of Bourgain, Clozel, and Kahane. Suppose $f \colon \mathbb{R}^{12} \to \mathbb{R}$ is an integrable function that is not identically zero. Normalize its Fourier…
Uncertainty principles for concentration of signals into truncated subspaces are considered. The ``classic'' uncertainty principle is explored as a special case of a more general operator framework. The time-bandwidth concentration problem…
This paper investigates performance limitations and tradeoffs in the control design for linear time-invariant systems. It is shown that control specifications in time domain and in frequency domain are always mutually exclusive determined…