On maximal synchronous codes.

DOI10.1016/S0304-3975(03)00097-5MaRDI QIDQ1426041zbMATH OpenFDO

Authors Yannick Guesnet

Publication date 14 March 2004

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

zbMATH Keywords

variable-length codesmaximal synchronous codessynchronous pair

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Recommendations

• On maximal codes with bounded synchronization delay
• Maximal Prefix-Synchronized Codes
• On the construction of maximal prefix-synchronized codes
• scientific article; zbMATH DE number 3659466
• On maximal prefix codes.
• On maximal codes with a finite interpreting delay.
• On the construction of statistically synchronizable codes
• Codes with bounded synchronization delay
• scientific article; zbMATH DE number 3910299
• Optimal synchronous coding

Cites work

• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• Completing codes
• Each regular code is included in a maximal regular code
• Extended synchronizing codewords for \(q\)-ary complete prefix codes
• Maximal bifix codes
• On codes having no finite completions
• On completion of codes with finite deciphering delay
• On maximal codes with a finite interpreting delay.
• On maximal codes with bounded synchronization delay

Cited in

(7)

• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• Completing circular codes in regular submonoids
• An embedding algorithm for supercodes and sucypercodes
• T-shift synchronization codes
• scientific article; zbMATH DE number 2145643 (Why is no real title available?)
• Each regular code is included in a maximal regular code
• Limited semaphore codes

This page was built for publication: On maximal synchronous codes.

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