Article contents
The comma-free codes with words of length two
Published online by Cambridge University Press: 17 April 2009
Abstract
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
- Copyright
- Copyright © Australian Mathematical Society 1976
References
- 2
- Cited by