Related papers: Bounds for Batch Codes with Restricted Query Size
A left-corner parsing algorithm with top-down filtering has been reported to show very efficient performance for unification-based systems. However, due to the nontermination of parsing with left-recursive grammars, top-down constraints…
This paper presents prefix codes which minimize various criteria constructed as a convex combination of maximum codeword length and average codeword length or maximum redundancy and average redundancy, including a convex combination of the…
A new lower bound for the maximal length of a multivector is obtained. It is much closer to the best known upper bound than previously reported lower bound estimates. The maximal length appears to be unexpectedly large for $n$-vectors, with…
We consider differentially private approximate singular vector computation. Known worst-case lower bounds show that the error of any differentially private algorithm must scale polynomially with the dimension of the singular vector. We are…
New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel. Both bounds are expressed using a quantity called the "smooth 0-divergence", which is a generalization of Renyi's divergence of order…
In this paper, we derive generic bounds on the maximum deviations in prediction errors for sequential prediction via an information-theoretic approach. The fundamental bounds are shown to depend only on the conditional entropy of the data…
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to the recent notion of hypertree decompositions allows to…
Maximally recoverable codes are a class of codes which recover from all potentially recoverable erasure patterns given the locality constraints of the code. In earlier works, these codes have been studied in the context of codes with…
Explicit characterization of the capacity region of communication networks is a long standing problem. While it is known that network coding can outperform routing and replication, the set of feasible rates is not known in general.…
An open question about Gabidulin codes is whether polynomial-time list decoding beyond half the minimum distance is possible or not. In this contribution, we give a lower and an upper bound on the list size, i.e., the number of codewords in…
A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes,…
In this paper, we construct linear codes over $\mathbb{Z}_4$ with bounded $GC$-content. The codes are obtained using a greedy algorithm over $\mathbb{Z}_4$. Further, upper and lower bounds are derived for the maximum size of DNA codes of…
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called \emph{Main Problem of Subspace Coding} is to determine the maximum size…
We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors.…
Lower bounds for some explicit decision problems over the complex numbers are given.
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…
This paper presents new upper bounds on the rate of linear $k$-hash codes in $\mathbb{F}_q^n$, $q\geq k$, that is, codes with the property that any $k$ distinct codewords are all simultaneously distinct in at least one coordinate.
In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…
We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree…
This paper gives upper bounds for the dimension of the singularity category of a Cohen-Macaulay local ring with an isolated singularity. One of them recovers an upper bound given by Ballard, Favero and Katzarkov in the case of a…