14 papers · ranked by Valyu relevance
Kamaludin Dingle, Chico Q. Camargo, Ard A. Louis
Many systems in nature can be described using discrete input-output maps. Without knowing details about a map, there may seem to be no a priori reason to expect that a randomly chosen input would be more likely to generate one output over another. Here, by extending fundamental results from algorithmic information…
Yasutada Oohama
We consider the rate distortion problem with side information at the decoder posed and investigated by Wyner and Ziv. Using side information and encoded original data, the decoder must reconstruct the original data with an arbitrary prescribed distortion level. The rate distortion region indicating the trade-off…
Yasutada Oohama
We consider the one helper source coding problem posed and investigated by Ahlswede, Körner and Wyner. Two correlated sources are separately encoded and are sent to a destination where the decoder wishes to decode one of the two sources with an arbitrary small error probability of decoding. In this system, the error…
Jesús E. Garca, Verónica A. González-López, Gustavo H. Tasca, Karina Y. Yaginuma + 1 more
In the framework of coding theory, under the assumption of a Markov process $(X_{t})$ on a finite alphabet $A,$ the compressed representation of the data will be composed of a description of the model used to code the data and the encoded data. Given the model, the Huffman’s algorithm is optimal for the number of bits…
Henk D. L. Hollmann, Patrick Solé
We construct a family of linear optimal functional-repair regenerating storage codes with parameters $({m,(n,k),(r,α,β)}={(2r-α+1)α/2,(r+1,r),(r,α,1)})$ for any integers $r,α$ with $1\leqα\leqr$, over any field when $α\in{1,r-1,r}$, and over any finite field $F_{q}$ with $q\geqr-1$ otherwise. These storage codes are…
Jesús Gutiérrez-Gutiérrez, Marta Zárraga-Rodríguez, Fernando M. Villar-Rosety, Xabier Insausti
'Fernando M. Villar-Rosety' 'Xabier Insausti'] In this paper, we give upper bounds for the rate-distortion function (RDF) of any Gaussian vector, and we propose coding strategies to achieve such bounds. We use these strategies to reduce the computational complexity of coding Gaussian asymptotically wide sense…
Anoop Thomas, Balaji Sundar Rajan
The connections between index coding and matroid theory have been well studied in the recent past. Index coding solutions were first connected to multi linear representation of matroids. For vector linear index codes, discrete polymatroids, which can be viewed as a generalization of the matroids, were used. The index…
Sreejith Sreekumar, Deniz Gündüz, Songze Li
A two-terminal distributed binary hypothesis testing problem over a noisy channel is studied. The two terminals, called the observer and the decision maker, each has access to n independent and identically distributed samples, denoted by $U$ and $V$, respectively. The observer communicates to the decision maker over a…
Jesús Gutiérrez-Gutiérrez, Marta Zárraga-Rodríguez, Xabier Insausti
In this paper, we study the asymptotic optimality of a low-complexity coding strategy for Gaussian vector sources. Specifically, we study the convergence speed of the rate of such a coding strategy when it is used to encode the most relevant vector sources, namely wide sense stationary (WSS), moving average (MA), and…
M. Ashok Kumar, Albert Sunny, Ashish Thakre, Ashisha Kumar + 3 more
'G. Dinesh Manohar' 'Nicusor Minculete' 'Shigeru Furuichi'] This paper establishes a close relationship among the four information theoretic problems, namely Campbell source coding, Arikan guessing, Huleihel et al. memoryless guessing and Bunte and Lapidoth tasks’ partitioning problems in the IID-lossless case. We…
Lin Zhou, Alfred Hero
We consider the k-user successive refinement problem with causal decoder side information and derive an exponential strong converse theorem. The rate-distortion region for the problem can be derived as a straightforward extension of the two-user case by Maor and Merhav (2008). We show that for any rate-distortion tuple…
Lei M. Li, Boris Ryabko
We consider the lossless compression bound of any individual data sequence. Conceptually, its Kolmogorov complexity is such a bound yet uncomputable. According to Shannon’s source coding theorem, the average compression bound is $nH$, where n is the number of words and H is the entropy of an oracle probability…
Nithin Nagaraj, Arun Somani
Error detection is a fundamental need in most computer networks and communication systems in order to combat the effect of noise. Error detection techniques have also been incorporated with lossless data compression algorithms for transmission across communication networks. In this paper, we propose to incorporate a…
Andrzej Chmielowiec, Paweł Litwin, Philip Broadbridge, Raúl Alcaraz
This article deals with compression of binary sequences with a given number of ones, which can also be considered as a list of indexes of a given length. The first part of the article shows that the entropy H of random n-element binary sequences with exactly k elements equal one satisfies the inequalities…