Coding of two-dimensional constraints of finite type by substitutions

Authors:
Christiane Frougny;Laurent Vuillon
Affiliations:
LIAFA, CNRS UMR, Paris Cedex, France and Université Paris 8;Laboratoire de Mathématiques, CNRS UMR, Université de Savoie, le Bourget-du-Lac, France
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2005

Citing 9
Cited 0

An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
The Number of Independent Sets in a Grid Graph

SIAM Journal on Discrete Mathematics
Regular Article: Forbidden Words in Symbolic Dynamics

Advances in Applied Mathematics
Automata, Languages, and Machines

Automata, Languages, and Machines
The capacity and coding gain of certain checkerboard codes

IEEE Transactions on Information Theory
Entropy bounds for constrained two-dimensional random fields

IEEE Transactions on Information Theory
Efficient code constructions for certain two-dimensional constraints

IEEE Transactions on Information Theory
On the capacity of two-dimensional run-length constrained channels

IEEE Transactions on Information Theory
Efficient coding schemes for the hard-square model

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an automatic method to generate transition matrices associated with two-dimensional contraints of finite type by using squared substitutions of constant dimension.