Comma-Free Codes

S. W. Golomb; Basil Gordon; L. R. Welch

doi:10.4153/CJM-1958-023-9

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let n be a fixed positive integer, and consider an alphabet consisting of the numbers 1, 2, … , n. With this alphabet form all possible k-letter words (a1a2 … ak), where k is also fixed. There are evidently nk such words in all.

References

1. Crick, H. C., Griffith, J. S., and Orgel, L. E., Codes Without Commas, Proc. Nat. Acad. Sci., 43 (1957), 416-421.Google Scholar

2. McMillan, B., Two Inequalities Implied by Unique Decipherability, IRE Transactions on Information Theory, 2 (1956), 115-116.Google Scholar

3. Nagell, T., Introduction to Number Theory (Uppsala, 1951).Google Scholar

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Jaynes, E. 1959. Note on unique decipherability. IEEE Transactions on Information Theory, Vol. 5, Issue. 3, p. 98.

Gilbert, E. 1960. Synchronization of binary messages. IEEE Transactions on Information Theory, Vol. 6, Issue. 4, p. 470.

Eckler, A. R. 1960. The Construction of Missile Guidance Codes Resistant to Random Interference. Bell System Technical Journal, Vol. 39, Issue. 4, p. 973.

1962. Topics in Engineering Logic. p. 221.

Kendall, W. and Reed, I. 1962. Path-invariant comma-free codes. IEEE Transactions on Information Theory, Vol. 8, Issue. 6, p. 350.

Jiggs, B. H. 1963. Regent Results in Comma-Free Codes. Canadian Journal of Mathematics, Vol. 15, Issue. , p. 178.

Gilbert, E. 1963. Cyclically permutable error-correcting codes. IEEE Transactions on Information Theory, Vol. 9, Issue. 3, p. 175.

Hansen, John C. 1963. An Integrated "Error-Free" Communication System. IEEE Transactions on Space Electronics and Telemetry, Vol. 9, Issue. 3, p. 92.

Eastman, W. and Even, S. 1964. On synchronizable and PSK-synchronizable block codes. IEEE Transactions on Information Theory, Vol. 10, Issue. 4, p. 351.

Golomb, Solomon W. and Gordon, Basil 1965. Codes with bounded synchronization delay. Information and Control, Vol. 8, Issue. 4, p. 355.

Golomb, Solomon W. and Baumert, Leonard D. 1965. Backtrack Programming. Journal of the ACM, Vol. 12, Issue. 4, p. 516.

Stiffler, J. 1965. Comma-free error-correcting codes. IEEE Transactions on Information Theory, Vol. 11, Issue. 1, p. 107.

Eastman, W. 1965. On the construction of comma-free codes. IEEE Transactions on Information Theory, Vol. 11, Issue. 2, p. 263.

Gilbert, E. N. 1966. Information Theory after 18 Years. Science, Vol. 152, Issue. 3720, p. 320.

Scholtz, R. 1966. Codes with synchronization capability. IEEE Transactions on Information Theory, Vol. 12, Issue. 2, p. 135.

Ullman, J. 1966. Near-optimal, single-synchronization-error-correcting code. IEEE Transactions on Information Theory, Vol. 12, Issue. 4, p. 418.

Levy, J. 1966. Self-synchronizing codes derived from binary cyclic codes. IEEE Transactions on Information Theory, Vol. 12, Issue. 3, p. 286.

Ullman, J. 1967. On the capabilities of codes to correct synchronization errors. IEEE Transactions on Information Theory, Vol. 13, Issue. 1, p. 95.

Ramamoorthy, C. and Tufts, D. 1967. Reinforced prefixed comma-free codes. IEEE Transactions on Information Theory, Vol. 13, Issue. 3, p. 366.

Clague, Dennis John 1967. New Classes of Synchronous Codes. IEEE Transactions on Electronic Computers, Vol. EC-16, Issue. 3, p. 290.

Download full list

Article contents

Comma-Free Codes

Extract

References

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests