By Topic

Lower bounds on the existence of binary error-correcting variable-length codes

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

2 Author(s)
C. Lamy ; Philips Recherche France, Suresnes, France ; F. -X. Bergot

The paper deals with codes that combine source and channel encoding operations. After discussing the potential usefulness of these variable-length error correcting (VLEC) codes, necessary conditions on their length distribution are established. It is shown that, depending on the targetted application, several families of VLEC codes can be defined, whose conditions of existence differ.

Published in:

Information Theory Workshop, 2003. Proceedings. 2003 IEEE

Date of Conference:

31 March-4 April 2003