相关论文: Bounds on the rate of superimposed codes

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 investigate the ratio $\rho_{n,L}$ of prefix codes to all uniquely decodable codes over an $n$-letter alphabet and with length distribution $L$. For any integers $n\geq 2$ and $m\geq 1$, we construct a lower bound and an upper bound for…

Traditionally, ensembles of Slepian-Wolf (SW) codes are defined such that every bin of each $n$-vector of each source is randomly drawn under the uniform distribution across the sets $\{0,1,\ldots,2^{nR_X}-1\}$ and…

Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…

A code is called solid if, roughly speaking, any correctly-transmitted codeword in an arbitrarily corrupted string of codewords can still be decoded correctly and unambiguously. So-called variable-length solid codes, in which codewords may…

Linear complementary dual (LCD) codes over finite fields are linear codes satisfying $C\cap C^{\perp}=\{0\}$. We generalize the LCD codes over finite fields to $\mathbb{Z}_2\mathbb{Z}_2[u]$-LCD codes over the ring…

In a recent paper, Tang and Ding introduced a class of binary cyclic codes of rate close to one half with a designed lower bound on their minimum distance. The definition involves the base $2$ expansion of the integers in their defining…

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find…

Let $0<\ell\in\mathbb{Z}$. The notion of an efficient dominating set or perfect code $S$ of a graph $G$ is generalized to that of an efficient dominating$\,^\ell$-set or perfect$^\ell$code, of the graph $G$, meaning that each vertex $v$ of…

We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of the attacker coalition. Lower bounds are obtained by considering…

We study uniquely decodable codes and list decodable codes in the high-noise regime, specifically codes that are uniquely decodable from $\frac{1-\varepsilon}{2}$ fraction of errors and list decodable from $1-\varepsilon$ fraction of…

We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval $[\ell,s]$ of $[-1,1)$. An intricate relationship between Levenshtein-type upper bounds on…

This paper presents general bounds on the highest achievable rate for list-decodable insertion-deletion codes. In particular, we give novel outer and inner bounds for the highest achievable communication rate of any insertion-deletion code…

Typical random codes (TRC) in a communication scenario of source coding with side information at the decoder is the main subject of this work. We study the semi-deterministic code ensemble, which is a certain variant of the ordinary random…

We suggest a new approach to obtain bounds on locally correctable and some locally testable binary linear codes, by arguing that these codes (or their subcodes) have coset leader graphs with high discrete Ricci curvature. The bounds we…

Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs.…

We consider questions related to the computation of the capacity of codes that avoid forbidden difference patterns. The maximal number of $n$-bit sequences whose pairwise differences do not contain some given forbidden difference patterns…

Performance evaluation of particular channel coding has been a significant topic in coding theory, often involving the use of bounding techniques. This paper focuses on the new family of capacity-achieving codes, Spinal codes, to provide a…

Let $(G,+)$ be an Abelian group. Given $h\in \mathbb{Z}^+$, a non-empty subset $A$ of $G$ is called an $S_h$-set if all the sums of $h$ distinct elements of $A$ are different. We extend the concept of $S_h$-set to a more general context in…

We give new constructions of two classes of algebraic code families which are efficiently list decodable with small output list size from a fraction $1-R-\epsilon$ of adversarial errors where $R$ is the rate of the code, for any desired…