Related papers: Universal polar dual pairs of spherical codes foun…
Optimal packing of spheres in $\mathbb R^d$ is studied by optimization of the energy $E$ (effective conductivity) of composites with ideally conducting spherical inclusions. It is demonstrated that the minimum of $E$ over locations of…
The Desarguesian ovoids in the orthogonal polar space $Q^+(7,q)$ with $q$ even have first been introduced by Kantor by examining the $8$-dimensional absolutely irreducible modular representations of $\text{PGL}(2,q^3)$. We investigate this…
In this article we revisit smoothing bounds in parallel between lattices $and$ codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian distributions and were crucial for arguing the security of many…
In a recent paper of Akhunzhanov and Shatskov the two-dimensional Dirichlet spectrum with respect to Euclidean norm was defined. We consider an analogous definition for arbitrary norms on $\mathbb{R}^2$ and prove that, for each such norm,…
Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…
A method is proposed for evaluation of single and double layer potentials of the Laplace and Helmholtz equations on piecewise smooth manifold boundary elements with constant densities. The method is based on a novel two-term decomposition…
A double-normal pair of a finite set $S$ of points from $R^d$ is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ perpendicular to $pq$. A double-normal pair $pq$ is…
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…
In this article I study pairing of two interacting particles in ideal 1D, 2D and Bethe lattices. I employ the method of recursion that has been formulated recently by Berciu et. al. to compute the pair functions in real space without…
If $K$ is a compact Hausdorff space so that the Banach lattice $C(K)$ is isometrically lattice isomorphic to a dual of some Banach lattice, then $C(K)$ can be decomposed as the $\ell^\infty$-direct sum of the carriers of a maximal singular…
We show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…
Symbol-pair codes were proposed for the application in high density storage systems, where it is not possible to read individual symbols. Yaakobi, Bruck and Siegel proved that the minimum pair-distance of binary linear cyclic codes…
A concatenated coding scheme over binary memoryless symmetric (BMS) channels using a polarization transformation followed by outer sub-codes is analyzed. Achievable error exponents and upper bounds on the error rate are derived. The first…
We provide an explicit planar Abelian dual for three-dimensional $\mathcal{N}=2$ $U(N)_k$ SQCD with $F$ fundamental chiral multiplets. This construction covers the entire $(N, F, k)$ parameter space (provided supersymmetry is unbroken),…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
We investigate several antipodal spherical designs on whether we can choose half of the points, one from each antipodal pair, such that they are balanced at the origin. In particular, root systems of type A, D and E, minimal points of Leech…
The intersection ${\bf C}\bigcap {\bf C}^{\perp}$ (${\bf C}\bigcap {\bf C}^{\perp_h}$) of a linear code ${\bf C}$ and its Euclidean dual ${\bf C}^{\perp}$ (Hermitian dual ${\bf C}^{\perp_h}$) is called the Euclidean (Hermitian) hull of this…
We study the performance of generalized polar (GP) codes when they are used for coding schemes involving erasure. GP codes are a family of codes which contains, among others, the standard polar codes of Ar{\i}kan and Reed-Muller codes. We…
We describe a generalization of the Lellouch-L\"uscher formula to the case of multiple strongly-coupled decay channels. As in the original formula, our final result is a relation between weak matrix elements in finite and infinite volumes.…
The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…