The author gives a characterization of finite maximal codes and uses this to find classes of codes with no finite completions. The author proves that for a finite maximal code, \(C\), over a two-letter alphabet, \(\{a,b\}\) where \(a^n,b^m\in C\), there is a corresponding \(m\)-multifactorization of \(\mathbb{Z}_n\). This result is then used to construct examples of codes that have no finite completion.
Recommendations
Cited in
(4)
This page was built for publication: A property of finite maximal codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373093)
