Locally complete sets and finite decomposable codes

DOI10.1016/S0304-3975(00)00440-0MaRDI QIDQ1605335zbMATH OpenFDO

Authors J. Néraud, C. Selmi

Publication date 15 July 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

interpretationcodedense setBernoulli distributioncomplete setfree monoidthin setmaximal codefree submonoidvery thin setlocally completevariable length codedecomposable codemorphic imageuncompletable word

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• scientific article; zbMATH DE number 3926268
• On codes having no finite completions
• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• scientific article; zbMATH DE number 2143015
• scientific article; zbMATH DE number 5117090

Cites work

• scientific article; zbMATH DE number 3926268 (Why is no real title available?)
• scientific article; zbMATH DE number 3970684 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 3332047 (Why is no real title available?)
• Completing codes
• Each regular code is included in a maximal regular code
• Elementariness of a finite set of words is co-NP-complete
• Minimal complete sets of words
• On codes with a finite deciphering delay: Constructing uncompletable words
• On completion of codes with finite deciphering delay
• On maximal codes with bounded synchronization delay
• Sur le théorème du defaut

Cited in

(5)

• On a complete set of operations for factorizing codes
• Some decompositions of Bernoulli sets and codes
• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• Coprimitive sets and inextendable codes
• Completing circular codes in regular submonoids

This page was built for publication: Locally complete sets and finite decomposable codes

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