2005
DOI: 10.1143/jpsj.74.488
|View full text |Cite
|
Sign up to set email alerts
|

Statistical Mechanical Approach to Error Exponents of Lossy Data Compression

Abstract: We present herein a scheme by which to accurately evaluate the error exponents of a lossy data compression problem, which characterize average probabilities over a code ensemble of compression failure and success above or below a critical compression rate, respectively, utilizing the replica method (RM). Although the existing method used in information theory (IT) is, in practice, limited to ensembles of randomly constructed codes, the proposed RMbased approach can be applied to a wider class of ensembles. Thi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
24
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(25 citation statements)
references
References 14 publications
1
24
0
Order By: Relevance
“…When the above general framework was applied to the random code ensemble, which is not a practical coding scheme, but can exhibit optimal performance, the theoretical limitationsthe RDF and optimal error exponents derived in IT [4,5] -were reproduced correctly [6,7].…”
Section: Compression By Perceptron and Theoretical Evaluationmentioning
confidence: 95%
“…When the above general framework was applied to the random code ensemble, which is not a practical coding scheme, but can exhibit optimal performance, the theoretical limitationsthe RDF and optimal error exponents derived in IT [4,5] -were reproduced correctly [6,7].…”
Section: Compression By Perceptron and Theoretical Evaluationmentioning
confidence: 95%
“…A few lines of computation show that the distortion in (19) actually saturates the Shannon bound. Let's call z the value of y where Φ ∞ (y) is maximal.…”
Section: The Shannon Boundmentioning
confidence: 99%
“…For instance, Low Density Generator Matrix (LDGM) code [7,8] and using a nonmonotonic perceptron [9,10,11] were proposed. In these compression codes, a decoder is first defined to retrieve a reproduced message from a codeword.…”
Section: Introductionmentioning
confidence: 99%