 |
HAL UPEC - UPEM Portal |  |
 |
Journal articles
Presentations of constrained systems with unconstrained positions
Abstract : We give a polynomial-time construction of the set of sequences that satisfy a finite-memory constraint defined by a finite list of forbidden blocks, with a specified set of bit positions unconstrained. Such a construction can be used to build modulation/error-correction codes (ECC codes) like the ones defined by the Immink-Wijngaarden scheme in which certain bit positions are reserved for ECC parity. We give a lineartime construction of a finite-state presentation of a constrained system defined by a periodic list of forbidden blocks. These systems, called periodic-finite-type systems, were introduced by Moision and Siegel. Finally, we present a linear-time algorithm for constructing the minimal periodic forbidden blocks of a finite sequence for a given period.
Cited literature [10 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-00619692
Contributor : Marie-Pierre Béal <>
Submitted on : Thursday, October 6, 2011 - 2:20:01 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Document(s) archivé(s) le : Saturday, January 7, 2012 - 2:20:32 AM
Contributor : Marie-Pierre Béal <>
Submitted on : Thursday, October 6, 2011 - 2:20:01 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Document(s) archivé(s) le : Saturday, January 7, 2012 - 2:20:32 AM
Files
hal.pdf
Files produced by the author(s)
