Geodesic
A New Result on Comma-Free Codes of Even Word-Length
Canadian journal of mathematics, Tome 39 (1987) no. 3, pp. 513-526

Voir la notice de l'article provenant de la source Cambridge University Press

Comma-free codes were first introduced in [1] in 1957 as a possible genetic coding scheme for protein synthesis. The general mathematical setting of such codes was presented in [3], and the biochemical and mathematical aspects of the problem were later summarized and extended in [4].Using the notation of [3], a set D of k-tuples or k-letter words, (a 1 a 2 ... a k ), where for fixed positive integers k and n, is said to be a comma-free dictionary if and only if, whenever (a 1 a 2 ... a k ) and (b 1 b 2 ... b k ) are in D, the “overlaps” are not in D. This precludes codewords having a subperiod less than k; and two codewords which are cyclic permutations of one another cannot both be in D. 
Tang, Betty; Golomb, Solomon W.; Graham, Ronald L. A New Result on Comma-Free Codes of Even Word-Length. Canadian journal of mathematics, Tome 39 (1987) no. 3, pp. 513-526. doi: 10.4153/CJM-1987-023-7
@article{10_4153_CJM_1987_023_7,
     author = {Tang, Betty and Golomb, Solomon W. and Graham, Ronald L.},
     title = {A {New} {Result} on {Comma-Free} {Codes} of {Even} {Word-Length}},
     journal = {Canadian journal of mathematics},
     pages = {513--526},
     year = {1987},
     volume = {39},
     number = {3},
     doi = {10.4153/CJM-1987-023-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1987-023-7/}
}
TY  - JOUR
AU  - Tang, Betty
AU  - Golomb, Solomon W.
AU  - Graham, Ronald L.
TI  - A New Result on Comma-Free Codes of Even Word-Length
JO  - Canadian journal of mathematics
PY  - 1987
SP  - 513
EP  - 526
VL  - 39
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1987-023-7/
DO  - 10.4153/CJM-1987-023-7
ID  - 10_4153_CJM_1987_023_7
ER  - 
%0 Journal Article
%A Tang, Betty
%A Golomb, Solomon W.
%A Graham, Ronald L.
%T A New Result on Comma-Free Codes of Even Word-Length
%J Canadian journal of mathematics
%D 1987
%P 513-526
%V 39
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1987-023-7/
%R 10.4153/CJM-1987-023-7
%F 10_4153_CJM_1987_023_7

[1] 1. Crick, F. H. C., Griffith, J. S. and Orgel, L. E., Codes without commas, Proc. Nat. Acad. Sci. 43 (1957), 416–421. Google Scholar

[2] 2. Eastman, W. L., On the construction of comma-free codes, IEEE Trans, on Information Theory, IT-11 (1965), 263–266. Google Scholar

[3] 3. Golomb, S. W., Gordon, B. and Welch, L. R., Comma-free codes, Can. J. Math. 10 (1958), 202–209. Google Scholar

[4] 4. Golomb, S. W., Welch, L. R. and Delbrück, M., Construction and properties of comma-free codes, Biol. Medd. Dan. Vid. Selsk. 23 (1958), 3–34. Google Scholar

[5] 5. Jiggs, B. H., Recent results in comma-free codes, Can. J. Math. 75 (1963), 178–187. Google Scholar

[6] 6. Scholtz, R. A., Maximal and variable word-length comma-free codes, IEEE Trans, on Information Theory, IT-15 (1969), 300–306. Google Scholar

[7] 7. van Lint, J. H., {0, 1, *} distance problems in combinatorics, Surveys in Combinatorics (1985), London Mathematical Society Lecture Note Series 103 (Cambridge University Press, 1985), 113–135. Google Scholar

Cité par Sources :