Surjective Extensions of Sliding-Block Codes

DOI10.1137/0406046zbMath0809.68090OpenAlexW2075065921MaRDI QIDQ4302270

Dominique Perrin, Selim Tuncel, Jonathan Ashley, Brian Marcus

Publication date: 14 August 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0406046

zbMATH Keywords

shift of finite typefactor mapsliding-block code

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Ergodic theory (37A99) Coding theorems (Shannon theory) (94A24)

Related Items (9)

A completion algorithm for codes with bounded synchronization delay ⋮ Bi-resolving graph homomorphisms and extensions of bi-closing codes ⋮ Weak equivalence for shifts of finite type ⋮ Codes and sofic constraints ⋮ Codes, unambiguous automata and sofic systems. ⋮ Embeddings of local automata ⋮ Completing codes in a sofic shift ⋮ Matrices of Polynomials, Positivity, and Finite Equivalence of Markov Chains ⋮ On maximal codes with bounded synchronization delay

This page was built for publication: Surjective Extensions of Sliding-Block Codes