作者:
Kang, WeiLiu, NanSoutheast Univ
Sch Informat Sci & Engn Nanjing 210096 Jiangsu Peoples R China Southeast Univ
Shing Tung Yau Ctr Nanjing 210096 Jiangsu Peoples R China Southeast Univ
Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China
In this paper, we study the error exponent in the problem of lossless source coding with a helper. We use the inherently typical subset lemma to remove the Markov chain constraint in the proof of the converse and obta...
详细信息
ISBN:
(纸本)9781538635995
In this paper, we study the error exponent in the problem of lossless source coding with a helper. We use the inherently typical subset lemma to remove the Markov chain constraint in the proof of the converse and obtain an upper bound on the error exponent, which is very close to the existing lower bound. The proposed upper bound and the existing lower bound meet when the rate pair is close to the boundary of the optimal rate region.
Summary form only given. Assuming the squared error distortion measure, the performance achieved is bounded by using scalar entropy constrained dithered quantization (SECDQ) to build multi-resolution (MR), multiple ac...
详细信息
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that re-ranks the neighbor hypotheses obta...
详细信息
ISBN:
(纸本)9781457705397
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that re-ranks the neighbor hypotheses obtained by these compressed-domain indexing methods. In contrast to the usual post-verification scheme, which performs exact distance calculation on the short-list of hypotheses, the estimated distances are refined based on short quantization codes, to avoid reading the full vectors from disk. We have released a new public dataset of one billion 128-dimensional vectors and proposed an experimental setup to evaluate high dimensional indexing algorithms on a realistic scale. Experiments show that our method accurately and efficiently re-ranks the neighbor hypotheses using little memory compared to the full vectors representation.
A subspace-based approach for rate-adaptive distributed source coding (DSC) based on discrete Fourier transform (DFT) codes is developed. Punctured DFT codes can be used to implement rate-adaptive source coding, howev...
详细信息
ISBN:
(纸本)9781479904464
A subspace-based approach for rate-adaptive distributed source coding (DSC) based on discrete Fourier transform (DFT) codes is developed. Punctured DFT codes can be used to implement rate-adaptive source coding, however they perform poorly after even moderate puncturing since the performance of the subspace error localization degrades severely. The proposed subspace-based error localization extends and improves the existing one, based on additional syndrome, and is naturally suitable for rate-adaptive distributed source coding architecture.
Modern mathematical proofs are becoming so big that they cause a problem of trust. Formal verification using proof-assistants has recently emerged as a solution to ensure the correctness of big proofs. Before being ab...
详细信息
ISBN:
(纸本)9784885522925
Modern mathematical proofs are becoming so big that they cause a problem of trust. Formal verification using proof-assistants has recently emerged as a solution to ensure the correctness of big proofs. Before being able to verify formally big proofs one must build substantial libraries of formal definitions and formal theorems. In this paper, we explain how we contribute to an existing formalization of information theory by extending it with a foundational theorem;namely, the variable-length source coding theorem.
We consider a secure source coding problem with side informations at the decoder and the eavesdropper. The encoder has a source that it wishes to describe with limited distortion through a rate-limited link to a legit...
详细信息
ISBN:
(纸本)9781479904464
We consider a secure source coding problem with side informations at the decoder and the eavesdropper. The encoder has a source that it wishes to describe with limited distortion through a rate-limited link to a legitimate decoder. The message sent is also observed by the eavesdropper. The encoder aims to minimize both the distortion incurred by the legitimate decoder;and the information leakage rate at the eavesdropper. When the encoder has access to the side information (S.I.) at the decoder, we characterize the rate-distortion-information leakage rate (R.D.I.) region under a Markov chain assumption and when S.I. at the encoder does not improve the rate-distortion region as compared to the case when S.I. is absent. We then extend our setting to consider the case where the encoder and decoder obtain coded S.I. through a rate-limited helper, and characterize the R.D.I. region for several special cases under logarithmic loss distortion (log-loss). Finally, we consider the case of list or entropy constraints at the decoder and show that the R.D.I. region coincides with R.D.I. region under log-loss.
We consider cascade and triangular source coding with side information and causal reconstruction at the end node. When the side information at the source and intermediate nodes are the same, we characterize the rate d...
详细信息
ISBN:
(纸本)9781457705953
We consider cascade and triangular source coding with side information and causal reconstruction at the end node. When the side information at the source and intermediate nodes are the same, we characterize the rate distortion regions for both the cascade and triangular source coding problems. For the general cascade setting with causal reconstruction at the end node, we characterize the rate region when the sources satisfy a positivity condition, or when a Markov chain holds.
The achievable rate region for the problem of lossless source coding with coded side information was derived by Ahlswede and Korner in 1975. While the Ahlswede-Korner. bound completely characterizes the achievable rat...
详细信息
ISBN:
(纸本)9781424415632
The achievable rate region for the problem of lossless source coding with coded side information was derived by Ahlswede and Korner in 1975. While the Ahlswede-Korner. bound completely characterizes the achievable rate region when the source and side information are memoryless, calculating this bound for a given memoryless joint probability mass function on the source and side information requires an optimization over all possible auxiliary random variables meeting a given Markov condition and alphabet size constraint. This optimization turns out to be surprisingly diffcult even for very simple distributions on the source and side information. We here propose a (1+epsilon) approximation algorithm for the given rate region. The proposed technique involves quantization of a space of conditional distributions followed by linear programming. The resulting algorithm guarantees performance within a multiplicative factor (1+epsilon) of the optimal performance - even when that optimal performance is unknown.
We consider a communication system in which the destination receives status updates from an information source that observes a physical process. The transmitter performs semantics-empowered filtering as a means to sen...
详细信息
ISBN:
(纸本)9781665426718
We consider a communication system in which the destination receives status updates from an information source that observes a physical process. The transmitter performs semantics-empowered filtering as a means to send only the most "important" samples to the receiver in a timely manner. As a first step, we explore a simple policy where the transmitter selects to encode only a fraction of the least frequent realizations of the observed random phenomenon, treating the remaining ones as not not informative. For this timely source coding problem, we derive the optimal codeword lengths in the sense of maximizing a semantics-aware utility function and minimizing a quadratic average length cost. Our numerical results show the optimal number of updates to transmit for different arrival rates and encoding costs and corroborate that semantic filtering results in higher performance in terms of timely delivery of important updates.
We derive a lower bound on each supporting hyperplane of the rate region of the vector Gaussian multiterminal source coding problem by coupling it with the CEO problem through a limiting argument. The tightness of thi...
详细信息
ISBN:
(纸本)9781467302234;9781467302241
We derive a lower bound on each supporting hyperplane of the rate region of the vector Gaussian multiterminal source coding problem by coupling it with the CEO problem through a limiting argument. The tightness of this lower bound in the high-resolution regime and the weak-dependence regime is proved.
暂无评论