Related papers: Designs in finite classical polar spaces
The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Ar{\i}kan proved that…
Heisenberg's uncertainty principle is often cited as an example of a "purely quantum" relation with no analogue in the classical limit where $\hbar \to 0$. However, this formulation of the classical limit is problematic for many reasons,…
Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial $t$-designs have been attracted lots of research interest for decades. The interplay between coding theory and $t$-designs has…
We identify universal polar dual pairs of spherical codes $C$ and $D$ such that for a large class of potential functions $h$ the minima of the discrete $h$-potential of $C$ on the sphere occur at the points of $D$ and vice versa. Moreover,…
A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find…
We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…
After the pursuit of seventy years, the invention of polar codes indicates that we have found the first capacity-achieving coding with low complexity construction and decoding, which is the great breakthrough of the coding theory in the…
Heisenberg-type higher order symmetries are studied for both classical and quantum mechanical systems separable in cartesian coordinates. A few particular cases of this type of superintegrable systems were already considered in the…
A $t\text{-}(n,k,\lambda;q)$-design is a set of $k$-subspaces, called blocks, of an $n$-dimensional vector space $V$ over the finite field with $q$ elements such that each $t$-subspace is contained in exactly $\lambda$ blocks. A partition…
We recall the definition of classical polar varieties, as well as those of affine and projective reciprocal polar varieties. The latter are defined with respect to a non-degenerate quadric, which gives us a notion of orthogonality. In…
Quasi-polar spaces are sets of points having the same intersection numbers with respect to hyperplanes as classical polar spaces. Non-classical examples of quasi-quadrics have been constructed using a technique called pivoting [5]. We…
We consider superintegrability in classical mechanics in the presence of magnetic fields. We focus on three-dimensional systems which are separable in Cartesian coordinates. We construct all possible minimally and maximally superintegrable…
We use $p$-rank bounds on partial ovoids and the classical bounds on Ramsey numbers to obtain upper bounds on the size of partial $m$-ovoids in finite classical polar spaces. These bounds imply non-existence of $m$-ovoids for new infinite…
Spherical $t$-design is a finite subset on sphere such that, for any polynomial of degree at most $t$, the average value of the integral on sphere can be replaced by the average value at the finite subset. It is well-known that an…
We study Euclidean designs from the viewpoint of the potential energy. For a finite set in Euclidean space, We formulate a linear programming bound for the potential energy by applying harmonic analysis on a sphere. We also introduce the…
If the generalized dynamics of K field theories (i.e., field theories with a non-standard kinetic term) is taken into account, then the possibility of so-called twin-like models opens up, that is, of different field theories which share the…
In this paper, we study the connection between polar codes and product codes. Our analysis shows that the product of two polar codes is again a polar code, and we provide guidelines to compute its frozen set on the basis of the frozen sets…
This paper investigates properties of polar codes that can be potentially useful in real-world applications. We start with analyzing the performance of finite-length polar codes over the binary erasure channel (BEC), while assuming belief…
We construct new polar coding schemes for the transmission of quantum or private classical information over arbitrary quantum channels. In the former case, our coding scheme achieves the symmetric coherent information and in the latter the…
Arikan's polar codes are capable of achieving the Shannon's capacity at a low encoding and decoding complexity, while inherently supporting rate adaptation. By virtue of these attractive features, polar codes have provided fierce…