Classifications of bifix codes

DOI10.1080/00207160902927055MaRDI QIDQ3056399zbMATH OpenOpenAlexFDO

Authors Zheng-Zhu Li, Yen-Shung Tsai

Publication date 12 November 2010

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

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

zbMATH Keywords

bifix codescomma-codescomma-free codesintercodes

Mathematics Subject Classification ID

Combinatorics on words (68R15) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Annihilators of bifix codes
• Some results on \((k, m)\)-comma codes
• K-comma codes and their generalizations
• scientific article; zbMATH DE number 858444
• Characterizations of k-comma codes and k-comma intercodes

Cites work

• A characterization of intercodes
• Annihilators of bifix codes
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 50943 (Why is no real title available?)

Cited in

(10)

• Some results on \((k, m)\)-comma codes
• Bifix codes and interval exchanges
• A simple suboptimal construction of cross-bifix-free codes
• Annihilators of bifix codes
• scientific article; zbMATH DE number 1972782 (Why is no real title available?)
• scientific article; zbMATH DE number 858444 (Why is no real title available?)
• Every regular bifix code is a finite union of regular infix codes
• Automata accepting bifix codes
• Characterizations of k-comma codes and k-comma intercodes
• Maximal bifix codes of degree 3

This page was built for publication: Classifications of bifix codes

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