By Topic

Tests for unique decipherability

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)

A test for unique decipherability of a given codeword set is described. The test also shows whether the set is decipherable with a finite delay, and in the latter case, determines the necessary delay. Finally, it is shown how the test of Sardinas and Patterson [1] can be used to get the same result, ^{1} as was conjectured by Gilbert and Moore [2].

Published in:

IEEE Transactions on Information Theory  (Volume:9 ,  Issue: 2 )