Related papers: On the covering dimension of a linear code
Matrix configurations define noncommutative spaces endowed with extra structure including a generalized Laplace operator, and hence a metric structure. Made dynamical via matrix models, they describe rich physical systems including…
The aim of this paper is to determine the critical exponent for the nonlinear wave equations with damping and potential terms of the scale invariant order, by assuming that these terms satisfy a special relation. We underline that our…
The Packing/Covering Conjecture was introduced by Bowler and Carmesin motivated by the Matroid Partition Theorem by Edmonds and Fulkerson. A packing for a family $ (M_i: i\in\Theta) $ of matroids on the common edge set $ E $ is a system $…
Nearly perfect packing codes are those codes that meet the Johnson upper bound on the size of error-correcting codes. This bound is an improvement to the sphere-packing bound. A related bound for covering codes is known as the van Wee…
We investigate the relation between the girth and the guaranteed error correction capability of $\gamma$-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms. A lower bound on the number of variable…
A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…
In this paper, a general algorithm is proposed for rate analysis and code design of linear index coding problems. Specifically a solution for minimum rank matrix completion problem over finite fields representing the linear index coding…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
A new connection between two different necessary conditions for a polymatroid to be linearly representable is presented. Specifically, we prove that the existence of a tensor product with the uniform matroid of rank two on three elements…
Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides a global level, they enable errors to be corrected locally, reducing the need for communication between storage nodes. There is a close…
Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…
We use the lace expansion to prove an infra-red bound for site percolation on the hypercubic lattice in high dimension. This implies the triangle condition and allows us to derive several critical exponents that characterize mean-field…
We consider the negative Laplacian subject to mixed boundary conditions on a bounded domain. We prove under very general geometric assumptions that slightly above the critical exponent $\frac{1}{2}$ its fractional power domains still…
The conserved Manna model with a planar absorbing boundary is studied in various space dimensions. We present a heuristic argument that allows one to compute the surface critical exponent in one dimension analytically. Moreover, we discuss…
The main aim of this paper is to study $LCD$ codes. Linear code with complementary dual($LCD$) are those codes which have their intersection with their dual code as $\{0\}$. In this paper we will give rather alternative proof of Massey's…
A set function can be extended to the unit cube in various ways; the correlation gap measures the ratio between two natural extensions. This quantity has been identified as the performance guarantee in a range of approximation algorithms…
For any geodesic current we associated a quasi-metric space. For a subclass of geodesic currents, called filling, it defines a metric and we study the critical exponent associated to this space. We show that is is equal to the exponential…
We conjecture that it is not possible to finitely axiomatize matroid representability in monadic second-order logic for matroids, and we describe some partial progress towards this conjecture. We present a collection of sentences in monadic…
We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a…
This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…