Locally complete sets and finite decomposable codes

DOI10.1016/S0304-3975(00)00440-0zbMath0996.68055MaRDI QIDQ1605335

Carla Selmi, Jean Néraud

Publication date: 15 July 2002

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

zbMATH Keywords

codelocally completeuncompletable wordthin setinterpretationdense setBernoulli distributionfree monoidcomplete setmaximal codefree submonoidvery thin setvariable length codedecomposable codemorphic image

Mathematics Subject Classification ID

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

Related Items (3)

Completing circular codes in regular submonoids ⋮ On a complete set of operations for factorizing codes ⋮ FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On completion of codes with finite deciphering delay
• Sur le théorème du defaut
• Minimal complete sets of words
• On maximal codes with bounded synchronization delay
• Elementariness of a finite set of words is co-NP-complete
• Each regular code is included in a maximal regular code
• Completing codes
• On codes with a finite deciphering delay: Constructing uncompletable words

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