### Abstract

The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite sequences.We firstly prove that the canonical coding partition of a regular set contains a finite number of regular classes. We give an algorithm for computing this partition. We then investigate maximality conditions in a coding partition and we prove, in the regular case, the equivalence between two different notions of maximality. As an application, we finally derive some new properties of maximal uniquely decipherable codes

Original language | English |
---|---|

Pages | 48-59 |

Number of pages | 12 |

Publication status | Published - 2007 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Coding partitions: regularity, maximality and global ambiguity'. Together they form a unique fingerprint.

## Cite this

Burderi, F., Restivo, A., & Béa, M-P. (2007).

*Coding partitions: regularity, maximality and global ambiguity*. 48-59.