Related papers: Generalized Spectral Bound for Quasi-Twisted Codes
Sum-rank codes have wide applications in multishot network coding, distributed storage and the construction of space-time codes. Asymptotically good sequences of linearized algebraic geometry sum-rank codes, exceeding the…
A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…
Sum-rank codes have known applications in the multishot network coding, the distributed storage and the construction of space-time codes. U. Mart\'{\i}nez-Pe\~{n}as introduced the cyclic-skew-cyclic sum-rank codes and proposed the BCH bound…
This paper proves a genericity conjecture by Goldstein, Schlag, and Voda[Invent. Math.\textbf{217}(2019)] for multi-frequency quasiperiodic Schr\"{o}dinger operators. Specifically, we show that for almost all coefficients of real…
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…
We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…
Horstein, Burnashev, Shayevitz and Feder, Naghshvar et al. and others have studied sequential transmission of a K-bit message over the binary symmetric channel (BSC) with full, noiseless feedback using posterior matching. Yang et al.…
We revisit the extendability-based semi-definite programming hierarchy introduced by Berta et al. [Mathematical Programming, 1 - 49 (2021)], which provides converging outer bounds on the optimal fidelity of approximate quantum error…
Leveraging algorithmic stability to derive sharp generalization bounds is a classic and powerful approach in learning theory. Since Vapnik and Chervonenkis [1974] first formalized the idea for analyzing SVMs, it has been utilized to study…
This paper establishes uniform bounds in characteristic $p$ rings which are either F-finite or essentially of finite type over an excellent local ring. These uniform bounds are then used to show that the Hilbert-Kunz length functions and…
Permutation codes have received a great attention due to various applications. For different applications, one needs permutation codes under different metrics. The generalized Cayley metric was introduced by Chee and Vu [4] and this metric…
Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…
We present a method for computing first order asymptotics of semiclassical spectra for 1-D Bogoliubov-de Gennes (BdG) Hamiltonian from Supraconductivity, which models the electron/hole scattering through two SNS junctions. This involves: 1)…
The problem of coding for networks experiencing worst-case symbol errors is considered. We argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network…
We introduce a notion of the Bergman-Shilov (or Shilov) boundary for some subclasses of upper-semicontinuous functions on a compact Hausdorff space. It is by definition the smallest closed subset of the given space on which all functions of…
We introduce a high-dimensional cubical complex, for any dimension t>0, and apply it to the design of quantum locally testable codes. Our complex is a natural generalization of the constructions by Panteleev and Kalachev and by Dinur et. al…
Achievable and converse bounds for general channels and mismatched decoding are derived. The direct (achievable) bound is derived using random coding and the analysis is tight up to factor 2. The converse is given in term of the achievable…
We prove a new bound for the minimum distance of geometric Goppa codes that generalizes two previous improved bounds. We include examples of the bound to one and two point codes over both the Suzuki and Hermitian curves.
Kitaev's toric code is arguably the most studied quantum code and is expected to be implemented in future generations of quantum computers. The renormalisation decoders introduced by Duclos-Cianci and Poulin exhibit one of the best…
In 2010, Shiffman and Zelditch proved a central limit theorem (CLT) for smooth statistics of Gaussian random zeros in codimension one over compact K\"ahler manifolds. They raised the question of whether this result admits a two-fold…