Related papers: Optimization of Generalized Unary Coding
In the last time some papers were devoted to the study of the con- nections between binary block codes and BCK-algebras. In this paper, we try to generalize these results to n-ary block codes, providing an algorithm which allows us to…
Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.
A systematic study of the probability distribution of superimposed random codes is presented through the use of generating functions. Special attention is paid to the cases of either uniformly distributed but not necessarily independent or…
We consider the problem of sequencing a set of positive numbers. We try to find the optimal sequence to maximize the variance of its partial sums. The optimal sequence is shown to have a beautiful structure. It is interesting to note that…
In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.
Boolean cardinality constraints state that at most (at least, or exactly) $k$ out of $n$ propositional literals can be true. We propose a new class of selection networks that can be used for an efficient encoding of them. Several comparator…
Coded distributed computing has been considered as a promising technique which makes large-scale systems robust to the "straggler" workers. Yet, practical system models for distributed computing have not been available that reflect the…
Permutation codes have recently garnered substantial research interest due to their potential in various applications including cloud storage systems, genome resequencing and flash memories. In this paper, we study the theoretical bounds…
Generalized Concatenated codes are a code construction consisting of a number of outer codes whose code symbols are protected by an inner code. As outer codes, we assume the most frequently used Reed-Solomon codes; as inner code, we assume…
Text compression schemes and compact data structures usually combine sophisticated probability models with basic coding methods whose average codeword length closely match the entropy of known distributions. In the frequent case where basic…
The union of a collection of $n$ sets is generally expressed in terms of a characteristic (indicator) function that contains $2^{n}-1$ terms. In this article, a much simpler expression is found that requires the evaluation of $n$ terms…
We introduce twisted unitary $t$-groups, a generalization of unitary $t$-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that…
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…
We consider a distributed source coding system in which several observations are communicated to the decoder using limited transmission rate. The observations must be separately coded. We introduce a robust distributed coding scheme which…
In this article we extend the theory of the binary codes (the strict code $\mathcal{K}$ and the extended code $\mathcal{K}'$), associated to a projective nodal surface, to a coding theory for normal surfaces, with special consideration of…
An optimal linear coding solution for index coding problem is established. Instead of network coding approach by focus on graph theoric and algebraic methods a linear coding program for solving both unicast and groupcast index coding…
A primitive $k$-batch code encodes a string $x$ of length $n$ into string $y$ of length $N$, such that each multiset of $k$ symbols from $x$ has $k$ mutually disjoint recovering sets from $y$. We develop new explicit and random coding…
The classical way of extending an $[n, k, d]$ linear code $\C$ is to add an overall parity-check coordinate to each codeword of the linear code $\C$. This extended code, denoted by $\overline{\C}(-\bone)$ and called the standardly extended…
We analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds. For the…
After proving a general no-cloning theorem for black boxes, we derive the optimal universal cloning of unitary transformations, from one to two copies. The optimal cloner is realized by quantum channels with memory, and greately outperforms…