Journal ArticleOPEN ACCESS

Comma-Free Codes

  • Golomb S
  • Gordon B
  • Welch L
Canadian Journal of Mathematics (1958) 10 202-209
DOI: 10.4153/cjm-1958-023-9
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

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 ( a 1 a 2 … a k ), where k is also fixed. There are evidently n k such words in all.

Cite

CITATION STYLE

APA

Golomb, S. W., Gordon, B., & Welch, L. R. (1958). Comma-Free Codes. Canadian Journal of Mathematics, 10, 202–209. https://doi.org/10.4153/cjm-1958-023-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free