Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...

The MPEG-4 video coding standard uses variable length codes (VLCs) to encode the indices of intra and inter macroblocks after discrete cosine transform and quantization. Although VLCs can achieve good compression, they are very sensitive to channel errors. Joint source-channel decoding (JSCD) is emerging as an efficient method for dealing with this sensitivity to channel errors. This paper prop...

In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network deanonymization, study of biological data, web graphs, etc. An achievable region for successful matching is derived by analyzing a new matching algorithm that we r...

A fundamental tool to prove inner bounds in classical network information theory is the so-called ‘conditional joint typicality lemma’. In addition lemma, one often uses unions and intersections of typical sets bound arguments without so much as giving them a second thought. These do not work quantum setting. This bottleneck shows up fact that ‘simultaneous decoders’, opposed ‘successive cancel...

An efficient joint source-channel (s/c) decoder based on the side information of the source and on the MN-Gallager algorithm over Galois fields is presented. The dynamical block priors (DBP) are derived either from a statistical mechanical approach via calculation of the entropy for the correlated sequences, or from the Markovian transition matrix. The Markovian joint s/c decoder has many advan...

In the field of collusion-resistant traitor tracing, Oosterwijk et al. recently determined the optimal suspicion function for simple decoders. Earlier, Moulin also considered another type of decoder: the generic joint decoder that compares all possible coalitions, and showed that usually the generic joint decoder outperforms the simple decoder. Both Amiri and Tardos, and Meerwald and Furon desc...

Stereoscopic video coding (SSVC) plays an important role in various 3D video applications. In SSVC, robust stereoscopic video transmission over error-prone networks is still a challenge problem to be solved. In this paper, we propose a joint encoder–decoder error control framework for SSVC, where error-resilient source coding, transmission network conditions, and error concealment scheme are jo...

We study the large-coalition asymptotics of fingerprinting and group testing, and derive explicit decoders that provably achieve capacity for many of the considered models. We do this both for simple decoders (fast but suboptimal) and for joint decoders (slow but optimal), and both for informed and uninformed settings. For fingerprinting, we show that if the pirate strategy is known, the Neyman...