Related papers: Improving the dimension bound of Hermitian Lifted …
We give a framework for generalizing LDPC code constructions that use Transversal Designs or related structures such as mutually orthogonal Latin squares. Our construction offers a broader range of code lengths and codes rates. Similar…
A code over a finite field is called locally recoverable code (LRC) if every coordinate symbol can be determined by a small number (at most r, this parameter is called locality) of other coordinate symbols. For a linear code with length n,…
In this work, we study the minimum/stopping distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m <= q. In the literature,…
We provide $L^p \to L^q$ refinements on some Fourier restriction estimates obtained using polynomial partitioning. Let $S\subset \mathbb{R}^3$ be a compact $C^\infty$ surface with strictly positive second fundamental form. We derive sharp…
We investigate one possible generalization of locally recoverable codes (LRC) with all-symbol locality and availability when recovering sets can intersect in a small number of coordinates. This feature allows us to increase the achievable…
Four different ways of obtaining low-density parity-check codes from expander graphs are considered. For each case, lower bounds on the minimum stopping set size and the minimum pseudocodeword weight of expander (LDPC) codes are derived.…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
This article focuses on Lp-estimates for the square root of elliptic systems of second order in divergence form on a bounded domain. We treat complex bounded measurable coefficients and allow for mixed Dirichlet/Neumann boundary conditions…
An array low-density parity-check (LDPC) code is a quasi-cyclic LDPC code specified by two integers $q$ and $m$, where $q$ is an odd prime and $m \leq q$. The exact minimum distance, for small $q$ and $m$, has been calculated, and tight…
For the generalized Jacobi, Laguerre and Hermite polynomials $P_n^{(\alpha_n, \beta_n)} (x), L_n^{(\alpha_n)} (x),$\break $H_n^{(\gamma_n)} (x)$ the limit distributions of the zeros are found, when the sequences $\alpha_n$ or $\beta_n$ tend…
We devise an analytically simple as well as invertible approximate expression, which describes the relation between the minimum distance of a binary code and the corresponding maximum attainable code-rate. For example, for a rate-(1/4),…
We design a heuristic method, a genetic algorithm, for the computation of an upper bound of the minimum distance of a linear code over a finite field. By the use of the row reduced echelon form, we obtain a permutation encoding of the…
Extending recent work on the Euclidean hull, we derive closed-form ratio decompositions for the number of linear codes with prescribed Hermitian and symplectic hull dimension. The Hermitian ratio admits a uniform lower bound of at least…
Consider the problem of partitioning an arbitrary metric space into pieces of diameter at most \Delta, such every pair of points is separated with relatively low probability. We propose a rate-based algorithm inspired by…
In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). The comparison to the lower bound…
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…
We present a new criterion for the weighted $L^p-L^q$ boundedness of multiplier operators for Laguerre and Hermite expansions that arise from a Laplace-Stieltjes transform. As a special case, we recover known results on weighted estimates…
In section 1 we give an improved lower bound on Hermite's constant $\delta_{2g}$ for symplectic lattices in even dimensions ($g=2n$) by applying a mean-value argument from the geometry of numbers to a subset of symmetric lattices. Here we…
Let $\mathbb{R}^m$ be endowed with the Euclidean metric. The covering radius of a lattice $\Lambda \subset \mathbb{R}^m$ is the least distance $r$ such that, given any point of $\mathbb{R}^m$, the distance from that point to $\Lambda$ is…
In recent years, several classes of codes are introduced to provide some fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) play an important role. However,…