New Classes of Synchronous Codes
- 1 June 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-16 (3) , 290-298
- https://doi.org/10.1109/PGEC.1967.264665
Abstract
New classes of codes with similar application to Gilbert's code [1] are defined. Weakening of his synchronizing condition gives higher efficiency in the new codes. One class (the F codes) is shown to be the most efficient possible among those codes which use Gilbert's method of achieving synchronization, i.e., the ``position fixing'' method. The other classes use a basically different method of achieving synchronization, and have even higher efficiencies than the F codes. The codes are compared mainly with regard to efficiency, but some idea of the hardware required is also given. The efficiency is compared to that of the bound on Golomb's comma-free codes [2], but evidence is supplied that codes constructed to carry information will never reach this limit.Keywords
This publication has 6 references indexed in Scilit:
- On the construction of comma-free codesIEEE Transactions on Information Theory, 1965
- Regent Results in Comma-Free CodesCanadian Journal of Mathematics, 1963
- Synchronization of binary messagesIEEE Transactions on Information Theory, 1960
- Variable-Length Binary EncodingsBell System Technical Journal, 1959
- Comma-Free CodesCanadian Journal of Mathematics, 1958
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952