Abstract:
We study the problem of recovering distorted arbitrarily long messages written
in some dynamically specified formal language. We obtain necessary and sufficient conditions
on the language definition for an admissible message to exist in a neighborhood of a distorted
message provided that local perturbations occur rarely.
Keywords:coding, formal language, dynamical system, shadowing of pseudo-trajectories.
Fulltext:
PDF file (146 kB)