相关论文: Designs in finite classical polar spaces

In this paper, we present an iterative construction of a polar code and develop properties of the dual of a polar code. Based on this approach, belief propagation of a polar code can be presented in the context of low-density parity check…

We extend the notion of polar duality to pairs of transverse Lagrangian planes in the standard symplectic space. This allows us to show that polar duality has a natural interpretation in terms of symplectic geometry. We apply our results to…

Polar codes have attracted much recent attention as the first codes with low computational complexity that provably achieve optimal rate-regions for a large class of information-theoretic problems. One significant drawback, however, is that…

A finite shift plane can be equivalently defined via abelian relative difference sets as well as planar functions. In this paper, we present a generic way to construct unitals in finite shift planes of odd orders $q^2$. We investigate…

Basic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than $ 1 $ are derived. An application in coding theory is illustrated by showing that multispace…

We consider the problem of supporting H-ARQ with polar codes. For supporting H-ARQ, we propose to create redundancy versions based on different, but equivalent, subsets of a polar code. The equivalent subsets are created from an initial…

At present, our notion of space is a classical concept. Taking the point of view that quantum theory is more fundamental than classical physics, and that space should be given a purely quantum definition, we revisit the notion of Euclidean…

The analogue of polar coordinates in the Euclidean space, a polar decomposition in a metric space, if well-defined, can be very useful in dealing with integrals with respect to a sufficiently regular measure. In this note we handle the…

Polar varieties have in recent years been used by Bank, Giusti, Heintz, Mbakop, and Pardo, and by Safey El Din and Schost, to find efficient procedures for determining points on all real components of a given non-singular algebraic variety.…

We generalize the superposition principle for time-symmetric initial data of black hole spacetimes to (anti-)de Sitter cosmologies in terms of an eigenvalue problem $\Delta_g\phi={1/8}(R_g-2\Lambda)\phi$ for a conformal scale $\phi$ applied…

We give an inequality on the packing of vectors/lines in quaternionic Hilbert space $\Hd$, which generalises those of Sidelnikov and Welch for unit vectors in $\Rd$ and $\Cd$. This has a parameter $t$, and depends only on the vectors up to…

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

We investigate spherical 4-distance 7-designs by studying their distance distributions. We compute these distance distributions and use their product (an integer) to derive certain divisibility conditions relating the dimension $n$ and the…

We review a technique for solving a class of classical linear partial differential systems of relevance to physics in Minkowski spacetime. All the equations are amenable to analysis in terms of complex solutions in the kernel of the scalar…

Polar codes are considered the latest major breakthrough in coding theory. Polar codes were introduced by Ar{\i}kan in 2008. In this letter, we show that the binary polar codes are the same as the optimized codes for bitwise multistage…

Let $\Gamma$ be a dual polar graph with diameter $D \geqslant 3$, having as vertices the maximal isotropic subspaces of a finite-dimensional vector space over the finite field $\mathbb{F}_q$ equipped with a non-degenerate form (alternating,…

Using a finite geometric framework for studying the pentagon and heptagon codes we show that the concepts of quantum secret sharing and contextuality can be studied in a nice and unified manner. The basic idea is a careful study of the…

Physical design problems, such as photonic inverse design, are typically solved using local optimization methods. These methods often produce what appear to be good or very good designs when compared to classical design methods, but it is…

A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows…

We have established the method of characterizing the unitary design generated by a symmetric local random circuit. Concretely, we have shown that the necessary and sufficient condition for the circuit asymptotically forming a t-design is…