Completion of recognizable bifix codes

DOI10.1016/0304-3975(94)00300-8MaRDI QIDQ673111zbMATH OpenOpenAlexFDO

Authors Liang Zhang, Zhonghui Shen

Publication date 28 February 1997

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

Full work available at URL https://doi.org/10.1016/0304-3975(94)00300-8

zbMATH Keywords

coding

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Completing biprefix codes
• Completion of codes with finite bi-decoding delays.
• Completing codes
• Finite Completion of comma-free codes Part 2
• scientific article; zbMATH DE number 1740160

Cited in

(19)

• Completing comma-free codes
• Every regular bifix code is a finite union of regular infix codes
• On maximal codes with a finite interpreting delay.
• Variable-length codes independent or closed with respect to edit relations
• Topologies for error-detecting variable-length codes
• Finite maximal solid codes
• Completing biprefix codes
• When variable-length codes meet the field of error detection
• On the maximality of languages with combined types of code properties
• scientific article; zbMATH DE number 1972782 (Why is no real title available?)
• On maximal codes with bounded synchronization delay
• Generalizations of Code Languages with Marginal Errors
• Completion of codes with finite bi-decoding delays.
• An application of Hajós factorizations to variable-length codes
• Completing codes in a sofic shift
• Maximal bifix codes
• Completing circular codes in regular submonoids
• scientific article; zbMATH DE number 1740160 (Why is no real title available?)
• A completion algorithm for codes with bounded synchronization delay

This page was built for publication: Completion of recognizable bifix codes

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