scientific article; zbMATH DE number 3373622

MaRDI QIDQ5645285zbMATH OpenFDO

Authors Vladimir Levenshtein

Publication date 1964

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Cited in

(10)

• On the bijective colouring of Cantor trees based on transducers
• Automata for solid codes
• On some free subsemigroups of a free semigroup
• On maximal codes with bounded synchronization delay
• A completion algorithm for codes with bounded synchronization delay
• Decidability of code properties
• On infinitary finite length codes
• A fast algorithm for the unique decipherability of multivalued encodings
• Decoders with initial state invariance for multivalued encodings
• Structure of decoders for multivalued encodings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5645285)