Tests for unique decipherability
- 1 April 1963
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 9 (2) , 109-112
- https://doi.org/10.1109/tit.1963.1057817
Abstract
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].Keywords
This publication has 4 references indexed in Scilit:
- On Information Lossless Automata of Finite OrderIEEE Transactions on Electronic Computers, 1965
- Generalized automata and their information losslessnessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1962
- Variable-Length Binary EncodingsBell System Technical Journal, 1959
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952