Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-22T06:35:51.208Z Has data issue: false hasContentIssue false
  • English
  • Français

The comma-free codes with words of length two

Published online by Cambridge University Press:  17 April 2009

A.H. Ball  and
L.J. Cummings
A.H. Ball
Affiliation:
Department of Mathematics, University of Newcastle, Newcastle, New South Wales
L.J. Cummings
Affiliation:
Faculty of Mathematics, University of Waterloo, Waterloo, Ontario, Canada.
Rights & Permissions [Opens in a new window]

Abstract

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.

A code not requiring a distinct symbol to separate words is called comma-free. Two codes are isomorphic if one can be obtained from the other by a permutation of the underlying alphabet. Since subcodes of comma-free codes are comma-free, we investigate only maximal comma-free codes. All isomorphism classes of maximal comma-free codes with words of length 2 are determined and a natural representative of each class is given.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 14 , Issue 2 , April 1976 , pp. 249 - 258
Copyright
Copyright © Australian Mathematical Society 1976

References

[1]Eastman, Willard L., “On the construction of comma-free codes”, IEEE Trans. Information Theory IT-11 (1965), 263–267.CrossRefGoogle Scholar
[2]Golomb, S.W., Gordon, Basil and Welch, L.R., “Comma-free codes”, Canad. J. Math. 10 (1958), 202–209.CrossRefGoogle Scholar
[3]Jiggs, B.H., “Recent results in comma-free codes”, Canad. J. Math. 15 (1963), 178–187.CrossRefGoogle Scholar
[4]Niho, Yoji, “On maximal comma-free codes”, IEEE Trans. Information Theory IT-19 (1973), 580–581.CrossRefGoogle Scholar