By Topic

Correction to 'A heuristic algorithm for the construction of a code with limited word length'

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
$33 $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

1 Author(s)
J. L. P. De Lameillieure ; Electron. Lab., Ghent Univ., Belgium

In the above-named work (see ibid., vol.IT-33, p.438-43, May 1987), a method was presented for the construction of a variable length code with maximum word-length constraint. The algorithm is partially based on the algorithm of A.H. Murakami et al. (1984), and is extended with heuristic choices for the bifurcations. C.H. Lu (1988) explains why step (1) taken by Murakami, which is used in De Lameillieure's contribution as condition (6), does not guarantee an optimum code when a word-length restriction is imposed. This step (1), or condition (6), does not take the bounded maximum word length into account. Therefore, in the present contribution the author rectifies this difficulty by proposing an adaptation of condition (6) into a composite condition for the case when there is a word-length constraint. Proofs of the components of this composite condition are presented together with numerical results.<>

Published in:

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