Related papers: Lower Bound on the Redundancy of PIR Codes
The smallest possible length of a $q$-ary linear code of covering radius $R$ and codimension (redundancy) $r$ is called the length function and is denoted by $\ell_q(r,R)$. In this work, for $q$ \emph{an arbitrary prime power}, we obtain…
Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of $n$ and $k.$ An application to graphs with many cycles is given.
Let $f^{(r)}(n;s,k)$ be the maximum number of edges in an $n$-vertex $r$-uniform hypergraph containing no $k$ edges on at most $s$ vertices. Brown, Erd\H{o}s and S\'os conjectured in 1973 that the limit $\lim_{n\rightarrow…
Consider a binary word being transmitted through a communication channel that introduces deletable errors where each bit of the word is either retained, flipped, erased or deleted. The simplest code for correcting \emph{all} possible…
A bounded operator $u$ on $X$ is called rigid when there is an increasing sequence of positive integers $(n_k)_{k\geq 1}$, such that for every $x$ in $X$ we have $\lim_{k \rightarrow +\infty} u^{n_k} x = x$. For any $r$ in $[0,1]$, we…
A triangulation of a surface is k-irreducible if every non-contractible curve has length at least k and any edge contraction breaks this property. Equivalently, every edge belongs to a non-contractible curve of length k and there are no…
The Ku\v{c}era-G\'acs theorem is a landmark result in algorithmic randomness asserting that every real is computable from a Martin-L\"of random real. If the computation of the first $n$ bits of a sequence requires $n+h(n)$ bits of the…
We present a general framework for Private Information Retrieval (PIR) from arbitrary coded databases, that allows one to adjust the rate of the scheme according to the suspected number of colluding servers. If the storage code is a…
Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance d. We study the minimum asymptotic redundancy \rho(q,n,d)=n-log_q A(q,n,d) as n grows while q and d are fixed. For any d and q<=d-1, long algebraic codes are…
Function-correcting codes, introduced by Lenz, Bitar, Wachter-Zeh, and Yaakobi, protect specific function values of a message rather than the entire message. A central challenge is determining the optimal redundancy -- the minimum…
We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that we study is when at most $k$ deletions occur in a window of…
An oblivious subspace embedding (OSE) for some eps, delta in (0,1/3) and d <= m <= n is a distribution D over R^{m x n} such that for any linear subspace W of R^n of dimension d, Pr_{Pi ~ D}(for all x in W, (1-eps) |x|_2 <= |Pi x|_2 <=…
For positive integers $s$ and $k_1, k_2, ..., k_s$, let $w(k_1,k_2,...,k_s)$ be the minimum integer $n$ such that any $s$-coloring $\{1,2,...,n\} \to \{1,2,...,s\}$ admits a $k_i$-term arithmetic progression of color $i$ for some $i$, $1…
The objective of this paper is to improve the customary definition of redundancy by providing quantitative measures in its place, which we coin upper and lower redundancies, that match better with an intuitive understanding of redundancy…
Locally repairable codes(LRCs) play important roles in distributed storage systems(DSS). LRCs with small locality have their own advantages since fewer available symbols are needed in the recovery of erased symbols. In this paper, we prove…
We investigate the stopping redundancy hierarchy of linear block codes and its connection to permutation decoding techniques. An element in the ordered list of stopping redundancy values represents the smallest number of possibly linearly…
In this article, we consider the order $\mathcal{O}_{f}={x+yf\sqrt{d}:x,\ y \in \Z}$ with conductor $f\in\N$ in a real quadratic field $K=\mathbb{Q}(\sqrt{d})$ where $d>0$ is square-free and $d\equiv2,3\pmod 4$. We obtain numerical…
We analyze the Dawid-Rissanen prequential maximum likelihood codes relative to one-parameter exponential family models M. If data are i.i.d. according to an (essentially) arbitrary P, then the redundancy grows at rate c/2 ln n. We show that…
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…
A code $C \colon \{0,1\}^k \to \{0,1\}^n$ is a $q$-query locally decodable code ($q$-LDC) if one can recover any chosen bit $b_i$ of the message $b \in \{0,1\}^k$ with good confidence by querying a corrupted string $\tilde{x}$ of the…