Comment on “Algorithm for Construction of Variable Length Code with Limited Maximum Word Length”

Document Type

Syllabus

Publication Date

1-1-1988

Abstract

The above paper1 presents a “top-down” algorithm for constructing an optimal variable length code. With the inclusion of a test for maximum word length constraint, the algorithm is also proposed for the construction of codes with bounded maximum word length. De Lameillieure and Bruyland [1] have recently pointed out that the tests in the second and the third steps of the algorithm are neither sufficient nor necessary and may lead to a nonoptimal code. This comment suggests further corrections and shows that although the algorithm with these corrections is optimal when there is no maximum word length constraint, it does not always lead to an optimal code when a maximum word length constraint is imposed. © 1988 IEEE

Identifier

0023984346 (Scopus)

Publication Title

IEEE Transactions on Communications

External Full Text Location

https://doi.org/10.1109/26.1462

ISSN

00906778

First Page

373

Last Page

375

Issue

3

Volume

36

This document is currently not available here.

Share

COinS