On strict codes

DOI10.1007/3-540-54345-7_74MaRDI QIDQ4035253zbMATH OpenFDO

Authors Nguyen Huong Lam, Do Long Van

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54345-7_74

zbMATH Keywords

composabilitymaximalitystrict codetheorem of defectwords with identical relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Review text

[For the entire collection see Zbl 0753.00030.] This paper continues an earlier one of the same authors [RAIRO, Inf. Theor. Appl. 24, No. 5, 441-458 (1990; Zbl 0704.68066)], where the notion of strict code has been defined. A strict code is a set of, finite and infinite, words with identical relations (finite or infinite) as the only relations on its elements. The maximality, the composability, etc. for 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 is proved. Some conditions for strict codes to be written by an indecomposable one are given. Note: The proof of theorem 3.1 contains a considerable error but repairable.

Recommendations

• scientific article; zbMATH DE number 33205
• scientific article; zbMATH DE number 3970679
• A survey on proper codes
• A survey on proper codes
• Codes correcting restricted errors
• On strictness and totality
• Strong coding
• Codes

Cited in

(2)

• scientific article; zbMATH DE number 3988734 (Why is no real title available?)
• scientific article; zbMATH DE number 33205 (Why is no real title available?)

This page was built for publication: On strict codes

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