Abstract
This paper continues an earlier paper of the authors. The maximality, the decomposability etc. for infinitary strict codes are considered. Every infinitary strict code is shown to be included in an infinitary strict-maximal one. The so-called Theorem of Defect for infinitary strict codes is proved. Some conditions for an infinitary strict code to be written by an indecomposable one are stated.
Cite
CITATION STYLE
APA
Lam, N. H., & Long Van, D. (1991). On strict codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 520 LNCS, pp. 301–317). Springer Verlag. https://doi.org/10.1007/3-540-54345-7_74
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free