English
Related papers

Related papers: Lossless Secure Source Coding: Yamamoto's Setting

200 papers

This paper studies variable-length (VL) source coding of general sources with side-information. Novel one-shot coding theorems for coding with common side-information available at the encoder and the decoder and Slepian- Wolf (SW) coding…

Information Theory · Computer Science 2014-04-09 Shigeaki Kuzuoka , Shun Watanabe

In this paper we study the nonasymptotic bounds of a special Joint Source-Channel Coding system with hierarchical source, where an observable source and an unobservable indirect source are required to be reconstructed. Namely, we focus on…

Information Theory · Computer Science 2026-03-17 Shuo Shao , Chao Qi , Jincheng Dai

Security aspects of the Index Coding with Side Information (ICSI) problem are investigated. Building on the results of Bar-Yossef et al. (2006), the properties of linear coding schemes for the ICSI problem are further explored. The notion…

Information Theory · Computer Science 2010-11-29 Son Hoang Dau , Vitaly Skachek , Yeow Meng Chee

Reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs) is considered. In MARCs, only the destination is interested in a reconstruction of the…

Information Theory · Computer Science 2012-07-04 Yonathan Murin , Ron Dabora , Deniz Gündüz

Source and channel coding over multiuser channels in which receivers have access to correlated source side information is considered. For several multiuser channel models necessary and sufficient conditions for optimal separation of the…

Information Theory · Computer Science 2009-07-09 Deniz Gunduz , Elza Erkip , Andrea Goldsmith , H. Vincent Poor

We study the fundamental problem of index coding under an additional privacy constraint that requires each receiver to learn nothing more about the collection of messages beyond its demanded messages from the server and what is available to…

Information Theory · Computer Science 2020-06-02 Varun Narayanan , Jithin Ravi , Vivek K. Mishra , Bikash Kumar Dey , Nikhil Karamchandani , Vinod M. Prabhakaran

We show an eavesdropping scheme, by which the eavesdropper can achieve the full information of the key against the protocol [Kye et al., PRL 95 040501 (2005)] with a probability of unity and will not be discovered by the the legitimate…

Quantum Physics · Physics 2007-05-23 Qiang Zhang , Xiang-Bin Wang , Yu-Ao Chen , Tao Yang , Jian-Wei Pan

This paper discusses a stylized communications problem where one wishes to transmit a real-valued signal x in R^n (a block of n pieces of information) to a remote receiver. We ask whether it is possible to transmit this information reliably…

Information Theory · Computer Science 2007-07-13 Emmanuel J. Candes , Paige A. Randall

We study a lossy source coding problem with secrecy constraints in which a remote information source should be transmitted to a single destination via multiple agents in the presence of a passive eavesdropper. The agents observe noisy…

Information Theory · Computer Science 2015-02-19 Farshad Naghibi , Somayeh Salimi , Mikael Skoglund

This paper studies the tradeoff in privacy and utility in a single-trial multi-terminal guessing (estimation) framework using a system model that is inspired by index coding. There are $n$ independent discrete sources at a data curator.…

Information Theory · Computer Science 2020-06-19 Yucheng Liu , Ni Ding , Parastoo Sadeghi , Thierry Rakotoarivelo

We consider the distributed source coding problem in which correlated data picked up by scattered sensors has to be encoded separately and transmitted to a common receiver, subject to a rate-distortion constraint. Although near-tooptimal…

Information Theory · Computer Science 2008-09-09 G. Maierbacher , J. Barros

This work studies point-to-point, multiple access, and random access lossless source coding in the finite-blocklength regime. In each scenario, a random coding technique is developed and used to analyze third-order coding performance.…

Information Theory · Computer Science 2020-10-13 Shuqing Chen , Michelle Effros , Victoria Kostina

Variable-length compression without prefix-free constraints and with side-information available at both encoder and decoder is considered. Instead of requiring the code to be error-free, we allow for it to have a non-vanishing error…

Information Theory · Computer Science 2020-08-24 Yuta Sakai , Vincent Y. F. Tan

We study the problem of single-server multi-message private information retrieval with side information. One user wants to recover $N$ out of $K$ independent messages which are stored at a single server. The user initially possesses a…

Information Theory · Computer Science 2018-08-20 Su Li , Michael Gastpar

A source encoder is stable if a small change in the source sequence (e.g., changing a few symbols) results in a small (or bounded) change in the output codeword. By this definition, the common technique of random binning is unstable;…

Information Theory · Computer Science 2026-01-26 Zhenduo Wen , Amin Gohari

This note describes some cryptographic issues related to multi-located parties. In general, multi-located parties make it difficult for the eavesdropper to mount the man-in-the-middle attack. Conversely, they make it easier to address…

Cryptography and Security · Computer Science 2009-05-20 Subhash Kak

This paper is devoted to the inverse problem of recovering the unknown distributed flux on an inaccessible part of boundary using measurement data on the accessible part. We establish and verify a variational source condition for this…

Analysis of PDEs · Mathematics 2019-02-20 De-Han Chen , Yousept Irwin , Jun Zou

We examine a situation in which an information-carrying signal is sent from two sources to a common receiver. The radiation travels through free space in the presence of noise. The information resides in a relationship between the two…

Quantum Physics · Physics 2007-05-23 Walter Simmons , Sandip Pakvasa

This paper investigates a unification of distributed source coding, multiple description coding, and source coding with side information at decoders. The equivalence between the multiple-decoder extension of distributed source coding with…

Information Theory · Computer Science 2024-10-28 Jun Muramatsu

A distributed storage system (DSS) needs to be efficiently accessible and repairable. Recently, considerable effort has been made towards the latter, while the former is usually not considered, since a trivial solution exists in the form of…

Information Theory · Computer Science 2020-01-16 Lukas Holzbaur , Stanislav Kruglik , Alexey Frolov , Antonia Wachter-Zeh