Achieving the rate-distortion bound with linear codes

被引：5

作者：

Chen, Jun ^{[1
]}

He, Da-ke ^{[1
]}

Jagmohan, Ashish ^{[1
]}

机构：

[1] IBM Corp, Thomas J Watson Res Ctr, Yorktown Hts, NY 10598 USA

来源：

2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2 | 2007年

关键词：

D O I：

10.1109/ITW.2007.4313153

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We show that linear codes can achieve the rate-distortion bound of a discrete memoryless source with arbitrary distortion measure if the size of finite field is sufficiently large. An alternative approach based on multilevel quantization is proposed. The optimality of this approach and the sufficiency of binary linear codes are established. Linear codes are also shown to be able to achieve a simplified version of the El Gamal-Cover (EGC) region for multiple description coding.

引用

页码：662 / 667

页数：6

共 50 条

[21] Minimax Rate-Distortion
Mahmood, Adeel
Wagner, Aaron B.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (12) : 7712 - 7737
[22] RATE-DISTORTION BOUND FOR A CLASS OF NON-GAUSSIAN SOURCES WITH MEMORY
ZHANG, YQ
PICKHOLTZ, RL
LOEW, MH
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (05) : 1697 - 1701
[23] Rate-distortion bound for joint compression and classification with application to multiaspect scattering
Dong, YT
Chang, SR
Carin, L
IEEE SENSORS JOURNAL, 2005, 5 (03) : 481 - 492
[24] The Rate-Distortion Function and Excess-Distortion Exponent of Sparse Regression Codes With Optimal Encoding
Venkataramanan, Ramji
Tatikonda, Sekhar
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (08) : 5228 - 5243
[25] A Lower Bound for the Rate-Distortion Function of Spike Sources that is Asymptotically Tight
Palzer, Lars
Timo, Roy
2016 IEEE INFORMATION THEORY WORKSHOP (ITW), 2016,
[26] Achieving optimal rate-distortion performance in arbitrarily-shaped transform coding
Shen, GB
Zeng, B
Liou, ML
ISCAS 2000: IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - PROCEEDINGS, VOL II: EMERGING TECHNOLOGIES FOR THE 21ST CENTURY, 2000, : 1 - 4
[27] On Multiple Decoding Attempts for Reed-Solomon Codes: A Rate-Distortion Approach
Nguyen, Phong S.
Pfister, Henry D.
Narayanan, Krishna R.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) : 668 - 691
[28] A Rate-Distortion Perspective on Multiple Decoding Attempts for Reed-Solomon Codes
Nguyen, Phong S.
Pfister, Henry D.
Narayanan, Krishna R.
2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 1235 - 1242
[29] COMPUTATION OF RATE-DISTORTION FUNCTIONS
CSISZAR, I
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (01) : 122 - 124
[30] Rate-Distortion Bounds for ε-Insensitive Distortion Measures
Watanabe, Kazuho
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (01) : 370 - 377

← 1 2 3 4 5 →