Related papers: Near optimal constructions of frameproof codes
In this work, we prove new results concerning the combinatorial properties of random linear codes. Firstly, we prove a lower bound on the list-size required for random linear codes over $\mathbb F_q$ $\varepsilon$-close to capacity to…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…
A $q$-ary $(n,k,r)$ locally repairable code (LRC) is an $[n,k,d]$ linear code over $\mathbb{F}_q$ such that every code symbol can be recovered by accessing at most $r$ other code symbols. The well-known Singleton-like bound says that $d \le…
When designing a preemptive online algorithm for the maximum matching problem, we wish to maintain a valid matching M while edges of the underlying graph are presented one after the other. When presented with an edge e, the algorithm should…
Recently, it was discovered by several authors that a $q$-ary optimal locally recoverable code, i.e., a locally recoverable code archiving the Singleton-type bound, can have length much bigger than $q+1$. This is quite different from the…
Binary $t$-frameproof codes ($t$-FPCs) are used in multimedia fingerprinting schemes where the identification of authorized users taking part in the averaging collusion attack is required. In this paper, a binary strongly…
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all…
The set of all subspaces of $\mathbb{F}_q^n$ is denoted by $\mathbb{P}_q(n)$. The subspace distance $d_S(X,Y) = \dim(X)+ \dim(Y) - 2\dim(X \cap Y)$ defined on $\mathbb{P}_q(n)$ turns it into a natural coding space for error correction in…
Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg \cite{TB14} first gave a…
Despite decades of research, cardinality estimation remains the optimizer's Achilles heel, with industrial-strength systems exhibiting a systemic tendency toward underestimation. At cloud scale, this is a severe production vulnerability: in…
A new property which relies on the linear programming (LP) decoder, the approximate maximum-likelihood certificate (AMLC), is introduced. When using the belief propagation decoder, this property is a measure of how close the decoded…
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…
We study codes with parameters of $q$-ary shortened Hamming codes, i.e., $(n=(q^m-q)/(q-1), q^{n-m}, 3)_q$. Firstly, we prove the fact mentioned in 1998 by Brouwer et al. that such codes are optimal, generalizing it to a bound for multifold…
In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…
Determining the maximum number of unit vectors in $\mathbb{R}^r$ with no pairwise inner product exceeding $\alpha$ is a fundamental problem in geometry and coding theory. In 1955, Rankin resolved this problem for all $\alpha \leq 0$ and in…
In the paper "New Results on Frame-Proof Codes and Traceability Schemes" by Reihaneh Safavi-Naini and Yejing Wang [IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 3029-3033, Nov. 2001], there are lower bounds for the maximal number of…
The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…
We study the maximum length of $q$-ary codes as a function of alphabet size, code size, and Singleton defect. For an $(n, M, d)_q$ code with dimension $\kappa = \log_q M \ge 2$ and Singleton defect $s = n - \lceil\kappa\rceil + 1 - d$, we…
For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…
We define and analyze low-rank parity-check (LRPC) codes over extension rings of the finite chain ring $\mathbb{Z}_{p^r}$, where $p$ is a prime and $r$ is a positive integer. LRPC codes have originally been proposed by Gaborit et al.(2013)…