By Topic

Source matching problems revisited

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chang, C.-I. ; Dept. of Electr. Eng., Maryland Univ., Baltimore, MD, USA ; Wolfe, L.B.

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

Published in:

Information Theory, IEEE Transactions on  (Volume:38 ,  Issue: 4 )