Skip to Main content Skip to Navigation
Journal articles

Coding partitions

Abstract : Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ''unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguous component and other (if any) totally ambiguous components. In the case the code is finite, we give an algorithm for computing its canonical partition. This, in particular, allows to decide whether a given partition of a finite code X is a coding partition. This last problem is then approached in the case the code is a rational set. We prove its decidability under the hypothesis that the partition contains a finite number of classes and each class is a rational set. Moreover we conjecture that the canonical partition satisfies such a hypothesis. Finally we consider also some relationships between coding partitions and varieties of codes.
Document type :
Journal articles
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-00966522
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, March 26, 2014 - 5:01:19 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:23 AM
Long-term archiving on: : Thursday, June 26, 2014 - 11:58:03 AM

File

666-2368-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00966522, version 1

Collections

Citation

Fabio Burderi, Antonio Restivo. Coding partitions. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (2), pp.227--239. ⟨hal-00966522⟩

Share

Metrics

Record views

113

Files downloads

682