Source matching problems revisited

Author

Chang, Chein-I ; Wolfe, Laurence B.

Author_Institution

Dept. of Electr. Eng., Maryland Univ., Baltimore, MD, USA

Volume

38

Issue

4

fYear

1992

fDate

7/1/1992 12:00:00 AM

Firstpage

1391

Lastpage

1395

Abstract

The source matching problem is to find the minimax codes that minimize the maximum redundancies over classes of sources where relative entropy (cross entropy, discrimination information) is adopted as a criterion to measure the redundancy. The convergence of a simple approach different from L.D. Davisson and A. Leon-Garcia´s (1980) algorithm for finding such minimax codes is presented and shown. This approach is applied as an example to the class of first-order discrete Markov sources. The sufficient statistic previously used by D.H. Lee (1983) in his attempt to produce results for the first-order Markov source matching problem is corrected. A computational complexity analysis and a numerical study further demonstrate that this simple algorithm significantly reduces the required computing time, when compared to Davisson and Leon-Garcia´s algorithm

Keywords

Markov processes; codes; computational complexity; information theory; minimax techniques; redundancy; computational complexity; convergence; cross entropy; discrimination information; first-order discrete Markov sources; minimax codes; numerical study; redundancy; relative entropy; source matching problem; sufficient statistic; Algorithm design and analysis; Approximation algorithms; Closed-form solution; Computational complexity; Convergence; Entropy; Iterative algorithms; Minimax techniques; Research initiatives; Statistics;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.144723

Filename

144723