Results 11 to 20 of about 10,040,691 (372)
Are Guessing, Source Coding and Tasks Partitioning Birds of A Feather? [PDF]
Entropy, 2022 This paper establishes a close relationship among the four information theoretic problems, namely Campbell source coding, Arikan guessing, Huleihel et al.
M. Ashok Kumar +4 more
doaj +2 more sources
Exponential Strong Converse for One Helper Source Coding Problem. [PDF]
Entropy (Basel), 2019 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
Oohama Y.
europepmc +2 more sources
Secure Source Coding with a Public Helper. [PDF]
IEEE Trans Inf Theory, 2013 We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eavesdropper, 2 ...
Kittichokechai K +4 more
europepmc +3 more sources
Gaussian Secure Source Coding and Wyner's Common Information [PDF]
International Symposium on Information Theory, 2015 We study secure source-coding with causal disclosure, under the Gaussian distribution. The optimality of Gaussian auxiliary random variables is shown in various scenarios.
Cuff, Paul, Satpathy, Sanket
core +2 more sources
Compress-and-Estimate Source Coding for a Vector Gaussian Source [PDF]
, 2017 We consider the remote vector source coding problem in which a vector Gaussian source is to be estimated from noisy linear measurements. For this problem, we derive the performance of the compress-and-estimate (CE) coding scheme and compare it to the ...
Ruiyang Song +3 more
openalex +3 more sources
Information Masking and Amplification: The Source Coding Setting [PDF]
IEEE International Symposium on Information Theory. Proceedings, 2012 The complementary problems of masking and amplifying channel state information in the Gel'fand-Pinsker channel have recently been solved by Merhav and Shamai, and Kim et al., respectively.
Courtade, Thomas
core +4 more sources
Rate-Distortion Analysis of Distributed Indirect Source Coding [PDF]
EntropyMotivated by task-oriented semantic communication and distributed learning systems, this paper studies a distributed indirect source coding problem where M correlated sources are independently encoded for a central decoder.
Jiancheng Tang, Qianqian Yang
doaj +2 more sources
Integer-Forcing Source Coding [PDF]
IEEE Transactions on Information Theory, 2014 Integer-Forcing (IF) is a new framework, based on compute-and-forward, for decoding multiple integer linear combinations from the output of a Gaussian multiple-input multiple-output channel. This work applies the IF approach to arrive at a new low-complexity scheme, IF source coding, for distributed lossy compression of correlated Gaussian sources ...
Or Ordentlich, Uri Erez
openaire +3 more sources
Adaptive Distributed Source Coding [PDF]
IEEE Transactions on Image Processing, 2012 We consider distributed source coding in the presence of hidden variables that parameterize the statistical dependence among sources. We derive the Slepian-Wolf bound and devise coding algorithms for a block-candidate model of this problem. The encoder sends, in addition to syndrome bits, a portion of the source to the decoder uncoded as doping bits ...
David, Varodayan +2 more
openaire +3 more sources
Bounds on the Sum-Rate of MIMO Causal Source Coding Systems with Memory under Spatio-Temporal Distortion Constraints. [PDF]
Entropy (Basel), 2020 Stavrou PA, Østergaard J, Skoglund M.
europepmc +3 more sources