D-Semifaithful Codes that are Universal over Both Memoryless Sources and Distortion Measures

Neri Merhav

doi:10.1109/TIT.2023.3253133

D-Semifaithful Codes that are Universal over Both Memoryless Sources and Distortion Measures

Neri Merhav

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

We prove the existence of codebooks for d -semifaithful lossy compression that are simultaneously universal with respect to both the class of finite-alphabet memoryless sources and the class of all bounded additive rational distortion measures. By applying independent random selection of the codewords according to a mixture of all memoryless sources, we achieve redundancy rates that are within O(\log n/n) close to the empirical rate-distortion function of every given source vector with respect to every bounded, rational distortion measure.

Original language	English
Pages (from-to)	4746-4757
Number of pages	12
Journal	IEEE Transactions on Information Theory
Volume	69
Issue number	7
DOIs	https://doi.org/10.1109/TIT.2023.3253133
State	Published - 1 Jul 2023

Keywords

Codes
Distortion measurement
Encoding
Nonlinear distortion
Probability distribution
Rate-distortion
Redundancy
lossy compression
random coding
rate-distortion theory
universal coding

All Science Journal Classification (ASJC) codes

Information Systems
Library and Information Sciences
Computer Science Applications

Access to Document

10.1109/TIT.2023.3253133

Cite this

@article{29910b1fd8614794ad736036951e6090,

title = "D-Semifaithful Codes that are Universal over Both Memoryless Sources and Distortion Measures",

abstract = "We prove the existence of codebooks for d -semifaithful lossy compression that are simultaneously universal with respect to both the class of finite-alphabet memoryless sources and the class of all bounded additive rational distortion measures. By applying independent random selection of the codewords according to a mixture of all memoryless sources, we achieve redundancy rates that are within O(\log n/n) close to the empirical rate-distortion function of every given source vector with respect to every bounded, rational distortion measure.",

keywords = "Codes, Distortion measurement, Encoding, Nonlinear distortion, Probability distribution, Rate-distortion, Redundancy, lossy compression, random coding, rate-distortion theory, universal coding",

author = "Neri Merhav",

note = "Publisher Copyright: IEEE",

year = "2023",

month = jul,

day = "1",

doi = "10.1109/TIT.2023.3253133",

language = "الإنجليزيّة",

volume = "69",

pages = "4746--4757",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - D-Semifaithful Codes that are Universal over Both Memoryless Sources and Distortion Measures

AU - Merhav, Neri

N1 - Publisher Copyright: IEEE

PY - 2023/7/1

Y1 - 2023/7/1

N2 - We prove the existence of codebooks for d -semifaithful lossy compression that are simultaneously universal with respect to both the class of finite-alphabet memoryless sources and the class of all bounded additive rational distortion measures. By applying independent random selection of the codewords according to a mixture of all memoryless sources, we achieve redundancy rates that are within O(\log n/n) close to the empirical rate-distortion function of every given source vector with respect to every bounded, rational distortion measure.

AB - We prove the existence of codebooks for d -semifaithful lossy compression that are simultaneously universal with respect to both the class of finite-alphabet memoryless sources and the class of all bounded additive rational distortion measures. By applying independent random selection of the codewords according to a mixture of all memoryless sources, we achieve redundancy rates that are within O(\log n/n) close to the empirical rate-distortion function of every given source vector with respect to every bounded, rational distortion measure.

KW - Codes

KW - Distortion measurement

KW - Encoding

KW - Nonlinear distortion

KW - Probability distribution

KW - Rate-distortion

KW - Redundancy

KW - lossy compression

KW - random coding

KW - rate-distortion theory

KW - universal coding

UR - http://www.scopus.com/inward/record.url?scp=85149819495&partnerID=8YFLogxK

U2 - 10.1109/TIT.2023.3253133

DO - 10.1109/TIT.2023.3253133

M3 - مقالة

SN - 0018-9448

VL - 69

SP - 4746

EP - 4757

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 7

ER -

D-Semifaithful Codes that are Universal over Both Memoryless Sources and Distortion Measures

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this