A characterization of intercodes

DOI10.1080/00207169008803909MaRDI QIDQ3479536zbMATH OpenOpenAlexFDO

Authors

Publication date 1990

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169008803909

zbMATH Keywords

bifix codescircular codescomma-free codesinfix codesintercodeslimited codesuniformly synchronous codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Information theory (general) (94A15)

Recommendations

• scientific article; zbMATH DE number 4143910
• Intercode regular languages
• Codes with bounded synchronization delay
• scientific article; zbMATH DE number 1948514
• Characterizations of k-comma codes and k-comma intercodes

Cites work

• Codes with bounded synchronization delay
• Comma-Free Codes
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)

Cited in

(13)

• Regular autodense languages
• Some results on \((k, m)\)-comma codes
• Classifications of bifix codes
• Intercode regular languages
• scientific article; zbMATH DE number 4143910 (Why is no real title available?)
• Relations on free monoids, their independent sets, and codes¹
• Product and interleaving of anticodes
• Intercodes and the semigroups they generate
• On decoding procedures of intertwining codes
• Intersection sets, three-character multisets and associated codes
• On the parameters of intertwining codes
• Properties of pure codes
• Characterizations of k-comma codes and k-comma intercodes

This page was built for publication: A characterization of intercodes

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