By Topic

Two-step encoding for finite sources

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)

Any finite information source is given a graph structure, in which two vertices are adjacent whenever the two corresponding source letters are distinguishable by the coder-decoder pair. Usual sources correspond, therefore, to complete graphs. If the associated graph is not complete, however, an \varepsilon -code for the source can be constructed in two steps: in the first, distinct codewords are given to distinguishable letters only; in the second step, a similar encoding is carried out for the complementary graph, in which distinguishable letters become indistinguishable and the converse. A particularly simple case shows up when nonadjacency is an equivalence relation among the vertices of the graph: each class of nondistinguishable letters can then be considered as a letter in a coarser source alphabet. The two-step procedure is then particularly intuitive. A problem arises when this procedure does not destroy optimality of the resulting \varepsilon -code; some partial results are given in this direction. The results obtained are largely based on some graph-theoretical ideas and tools.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 6 )