On the factorization of codes
From MaRDI portal
Publication:796308
zbMATH Open0543.68063MaRDI QIDQ796308FDOQ796308
Authors: Christophe Reutenauer 
Publication date: 1983
Published in: Ricerche di Matematica (Search for Journal in Brave)
Recommendations
factorizationcharacteristic polynomialmaximal codefree associative algebrafree subset of a free monoid
Formal languages and automata (68Q45) Other types of codes (94B60) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (28)
- Title not available (Why is that?)
- Noncommutative factorization of variable-length codes
- SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
- A partial result about the factorization conjecture for finite variable- length codes
- Title not available (Why is that?)
- Ensembles libres de chemins dans un graphe
- Title not available (Why is that?)
- Shortening Array Codes and the Perfect $1$-Factorization Conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Codes limites et factorisations finies du monoïde libre
- On factorizing codes: Structural properties and related decision problems
- On $z$-submonoids and $z$-codes
- Construction of a family of finite maximal codes
- On a complete set of operations for factorizing codes
- Finite maximal codes and factorizations of cyclic groups
- Hajós factorizations and completion of codes.
- An enhanced property of factorizing codes
- Factorizing The Polynomial of a Code
- A note on the factorization conjecture
- On the factorization conjecture
- Hypercube 1-factorizations from extended Hamming codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- On some Schützenberger conjectures
- Construction de codes factorisants
This page was built for publication: On the factorization of codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796308)
