检索结果-内蒙古大学图书馆

source coding with quantum side information at several decoders

QUANTUM INFORMATION PROCESSING 2023年第5期22卷 212-212页

作者： Han, Xu Liu, Xiaomin Xi, Zhengjun Shaanxi Normal Univ Coll Comp Sci Xian 710062 Shaanxi Peoples R China

We consider the task of the classical source coding with quantum side information at several decoders. This is a quantum generalization of classical Sgarro's three correlated information sources. We focus on classical-quantum sources, which involve the classical coding part, using the quantum part as side information at the decoder. We consider two models: non-entangled and entangled side information. To obtain optimal coding rate, we develop a quantum version of maximal simultaneous codes. The achievable rate is found to be determined by the maximally quantum conditional entropy between the classical source and side information. In particular, our result shows that the more the size of the quantum part, the smaller the coding rate.

关键词： Classical-quantum sources source coding Quantum side information Maximal simultaneous codes Conditional entropy

来源：评论

学校读者我要写书评

暂无评论

Outer Bounds for Multiterminal source coding via a Strong Data Processing Inequality

Outer Bounds for Multiterminal Source Coding via a Strong Da...

引用

IEEE International Symposium on Information Theory Proceedings (ISIT)

作者： Courtade, Thomas A. Stanford Univ Dept Elect Engn Stanford CA 94305 USA

ISBN: (纸本)9781479904464

An intuitive outer bound for the multiterminal source coding problem is given. The proposed bound explicitly couples the rate distortion functions for each source and correlation measures which derive from a "strong" data processing inequality. Unlike many standard outer bounds, the proposed bound is not parameterized by a continuous family of auxiliary random variables, but instead only requires maximizing two ratios of divergences which do not depend on the distortion functions under consideration.

关键词： distortion source coding

来源：评论

学校读者我要写书评

暂无评论

Achievable Rate Regions for source coding with Delayed Partial Side Information

Achievable Rate Regions for Source Coding with Delayed Parti...

引用

41st Symposium on Information Theory and its Applications (SITA)

作者： Matsuta, Tetsunao Uyematsu, Tomohiko Tokyo Inst Technol Dept Informat & Commun Engn Tokyo 1528552 Japan

In this paper, we consider a source coding with side information partially used at the decoder through a codeword. We assume that there exists a relative delay (or gap) of the correlation between the source sequence and side information. We also assume that the delay is unknown but the maximum of possible delays is known to two encoders and the decoder, where we allow the maximum of delays to change by the block length. In this source coding, we give an inner bound and an outer bound on the achievable rate region, where the achievable rate region is the set of rate pairs of encoders such that the decoding error probability vanishes as the block length tends to infinity. Furthermore, we clarify that the inner bound coincides with the outer bound when the maximum of delays for the block length converges to a constant.

关键词： achievable rate region delay side information source coding

来源：评论

学校读者我要写书评

暂无评论

Bounds for Learning Lossless source coding

Bounds for Learning Lossless Source Coding

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Host-Madsen, Anders Univ Hawaii Manoa Dept Elect Engn Honolulu HI 96822 USA

ISBN: (纸本)9781538682098

This paper asks a basic question: how much training is required to beat a universal source coder? Traditionally, there have been two types of source coders: fixed, optimum coders such as Huffman coders;and universal source coders, such as Lempel-Ziv. The paper considers a third type of source coders: learned coders. These are coders that are trained on data of a particular type, and then used to encode new data of that type. This is a type of coder that has recently become popular for (lossy) image and video coding. The paper evaluates two criteria for performance of learned coders: the average performance over training data, and a guaranteed performance for all training except for some error probability P-e, which is PAC learning. In both cases the coders are evaluated with respect to redundancy. The paper considers the independent identically distributed (HD) binary case and binary Markov chains. In both cases it is shown that the amount of training data required is very moderate: to code sequences of length l the amount of training data required to beat a universal source coder is m = K l/log l, where the constant K depends on the case considered.

关键词： Training Video coding Error probability source coding Redundancy Training data Machine learning

来源：评论

学校读者我要写书评

暂无评论

The Likelihood Encoder for source coding

The Likelihood Encoder for Source Coding

引用

IEEE Information Theory Workshop (ITW)

作者： Cuff, Paul Song, Eva C. Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781479913213

The likelihood encoder with a random codebook is demonstrated as an effective tool for source coding. Coupled with a soft covering lemma (associated with channel resolvability), likelihood encoders yield simple achievability proofs for known results, such as rate-distortion theory. They also produce a tractable analysis for secure rate-distortion theory and strong coordination.

关键词： source coding Rate distortion theory ENCODER Likelihood

来源：评论

学校读者我要写书评

暂无评论

Distributed Decision Fusion With M-ary source coding On Sensor Observation and Uncoded Data Transmission 17

Distributed Decision Fusion With M-ary Source Coding On Sens...

引用

IEEE 17th Annual Consumer Communications and Networking Conference (CCNC)

作者： Cheng, Victor W. Wang, Tsang-Yi Wang, Hao Natl Chi Nan Univ Dept Comp Sci & Informat Engn Puli Taiwan Natl Sun Yat Sen Univ Inst Commun Engn Kaohsiung Taiwan

ISBN: (数字)9781728138930

ISBN: (纸本)9781728138930

M-ary source coding scheme on sensor detection is able to improve the detection performance on the final decision made at the fusion center (FC). In this paper, a new M-ary source coding scheme using analog transmission is proposed for distributed binary detection. In the scheme, the source coding is through the quantization process, but the output of the quantizer is transmitted directly without digitalizing and coding process. In the FC, the linear combiner detection rule is adopted to make the final decision. The problem of huge channel bandwidth demand can be avoided by using the considered M-ary source coding scheme. The goal of the proposed scheme is to minimize the decision errors at the FC via optimizing the region allocation. The error performances using maximum-a-posteriori (MAP) and equal-gain-combining (EGC) fusion rules are analyzed. The proposed M-ary source coding scheme is illustrated with numerical examples highlighting its significant improvement in error performance and enhanced information available at the FC when the transmission is via either additive white Gaussian noise (AWGN) or Rayleigh faded channel.

关键词： Distributed detection source coding decision fusion wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Duality between source coding with quantum side information and c-q channel coding

Duality between source coding with quantum side information ...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Cheng, Hao-Chung Hanson, Eric P. Datta, Nilanjana Hsieh, Min-Hsiu Univ Technol Sydney Sydney NSW Australia Univ Cambridge Cambridge England

ISBN: (纸本)9781538692912

In this paper, we establish an interesting duality between two different quantum information-processing tasks, namely, classical source coding with quantum side information, and channel coding over classical-quantum channels. The duality relates the optimal error exponents of these two tasks, generalizing the classical results of Ahlswede and Dueck. We establish duality both at the operational level and at the level of the entropic quantities characterizing these exponents. For the latter, the duality is given by an exact relation, whereas for the former, duality manifests itself in the following sense: an optimal coding strategy for one task can be used to construct an optimal coding strategy for the other task. Along the way, we derive a bound on the error exponent for classical-quantum channel coding with constant composition codes which might be of independent interest.

关键词： Channel coding Decoding source coding Task analysis Protocols

来源：评论

学校读者我要写书评

暂无评论

New Distributed source coding Scheme based on LDPC Codes with source Revealing Rate-Adaptation

New Distributed Source Coding Scheme based on LDPC Codes wit...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)

作者： Shin, Sang-Yun Jang, Min Kang, Jin Whan Kim, Sang-Hyo Sungkyunkwan Univ Sch Informat & Commun Engn Suwon 440746 South Korea

ISBN: (纸本)9781457702518

In this paper, we propose a new Distributed source coding (DSC) scheme based on Low-Density Parity-Check (LDPC) codes with source revealing rate-adaptation. This scheme consists of LDPC codes which are well designed at their respective operating rates. The member codes do not need to be designed with any rate-adaptation criterion. Instead, when decoding fails, source revealing method is used. Numerical results show that the proposed scheme performs within average 5.6% of the Slepian-Wolf bound over the entire compression rate region. The decoding complexity also dramatically decreases by 57%.

关键词： Correlation Decoding Error correction codes Indexes LDPC codes Parity check codes Slepian-Wolf bound source coding compression rate region decoding decoding complexity distributed source coding low-density parity-check codes parity check codes rate-adaptation criterion source coding source revealing rate-adaptation

来源：评论

学校读者我要写书评

暂无评论

Optimized Short-Length Rate-Adaptive LDPC Codes for Slepian-Wolf source coding 25

Optimized Short-Length Rate-Adaptive LDPC Codes for Slepian-...

引用

25th International Conference on Telecommunications (ICT)

作者： Ye, Fangping Mheich, Zeina Dupraz, Elsa Amis, Karine UBL Lab STICC IMT Atlantique F-29238 Brest France

ISBN: (纸本)9781538623213

This paper proposes a new construction of rate-adaptive coding schemes based on Low Density Parity Check (LDPC) codes for Slepian Wolf source coding. Unlike standard rate-adaptive source coding schemes, the code construction we propose is based on finite-length code design tools that permit to greatly improve the decoding performance at short to moderate length. In particular, our method permits to limit the number of short cycles in the codes at all rates of interest, and to avoid eliminating some source bits from the code constraints. The proposed method shows a performance improvement of up to an order of magnitude at almost all the considered rates compared to the standard LDPCA construction.

关键词： Parity check codes Decoding source coding Standards Design tools Channel coding"

来源：评论

学校读者我要写书评

暂无评论

Evaluation Program of an Efficient source coding Algorithm Under the Condition of Converting Metric Spaces

Evaluation Program of an Efficient Source Coding Algorithm U...

引用

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)

作者： Adzhemov, A. S. Kudryashova, A. Y. Moscow Tech Univ Commun & Informat Moscow Russia

ISBN: (纸本)9781728122885

In modern communication systems, the issues of ensuring the required quality of signal transmission are highly relevant. This article proposes an algorithm and a program built on its basis for evaluating the effective coding of a source of signals when they are converted in various metric spaces, and in particular for the currently widely used analog-digital conversion of a continuous signal into a binary one. The estimation algorithm takes into account the distortion indicators when encoding with a binary code, the likelihood of these distortions occurring during the transmission of message elements and the likelihood of a message appearing on the communication channel. In addition to the algorithm itself, its software implementation is proposed, created using the C # programming language. The software implementation has a graphical environment for the user.

关键词： efficient coding source coding metric spaces analog to digital binary code

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：