13 papers · ranked by Valyu relevance
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…
Rui Tang, Songjie Xie, Youlong Wu, Song-Nam Hong
This paper focuses on K-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey K private messages to K receivers. A general inner bound on the capacity region is proposed based on an exhaustive message splitting and a K-level modified Marton’s coding.…
Neri Merhav, Luca Faes
We propose a universal ensemble for the random selection of rate-distortion codes which is asymptotically optimal in a sample-wise sense. According to this ensemble, each reproduction vector, $x^$, is selected independently at random under the probability distribution that is proportional to $2-LZ(x^)$, where $LZ(x^)$…
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…
Naruki Shinohara, Hideki Yagi, Jun Chen, Sadaf Salehkalaibar
The utilization of databases such as IoT has progressed, and understanding how to protect the privacy of data is an important issue. As pioneering work, in 1983, Yamamoto assumed the source (database), which consists of public information and private information, and found theoretical limits (first-order rate analysis)…
Valéria G. Pedrosa, Max H. M. Costa, Sangun Park
The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to…
Ling-Hua Chang, Po-Ning Chen, Fady Alajaji, Jun Chen + 1 more
'Sadaf Salehkalaibar'] The error probability of block codes sent under a non-uniform input distribution over the memoryless binary symmetric channel (BSC) and decoded via the maximum a posteriori (MAP) decoding rule is investigated. It is proved that the ratio of the probability of MAP decoder ties to the probability…
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…
Niklas Gassner, Marcus Greferath, Joachim Rosenthal, Violetta Weger + 4 more
'Onur Günlü' 'Rafael F. Schaefer' 'Holger Boche' 'H. Vincent Poor'] Coding theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. It has been well established that, with the generalization of the algebraic structure to rings, there…
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…
Neri Merhav, Raúl Alcaraz
We extend Ziv and Lempel’s model of finite-state encoders to the realm of lossy compression of individual sequences. In particular, the model of the encoder includes a finite-state reconstruction codebook followed by an information lossless finite-state encoder that compresses the reconstruction codeword with no…
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…
Kun Tu, Dariusz Puchala, Jun Chen, Sadaf Salehkalaibar
In this paper, we address the problem of m-gram entropy variable-to-variable coding, extending the classical Huffman algorithm to the case of coding m-element (i.e., m-grams) sequences of symbols taken from the stream of input data for $m>1$. We propose a procedure to enable the determination of the frequencies of the…