Finite non-codes revisited from algorithmic points of view

MaRDI QIDQ5252051zbMATH OpenFDO

Authors Etsuro Moriya

Publication date 21 May 2015

zbMATH Keywords

codescodewordsformal languagesnon-codes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Other types of codes (94B60)

Recommendations

• Algorithmic ways of deciding whether an infinite language is a code
• On codes having no finite completions
• Noncommutative factorization of variable-length codes
• scientific article; zbMATH DE number 2113094
• On a test for codes

Cited in

(5)

• Generalized code chains with certain properties
• Algorithmic ways of deciding whether an infinite language is a code
• Finitary Codes, a short survey
• Generalizations of Code Languages with Marginal Errors
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)

This page was built for publication: Finite non-codes revisited from algorithmic points of view

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