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)

Full work available at URL https://doi.org/10.1016/S0304-3975(03)00097-5

zbMATH Keywords

maximal synchronous codessynchronous pairvariable-length codes

Mathematics Subject Classification ID

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

Review text

The paper contains, as the main result, a construction of maximal synchronous codes. More precisely, it is proved that for a given synchronous code \(X\) with a synchronous pair \((x,y)\) the code \(X\cup V\), where \(V=(xyA^*\cap A^*xy)\setminus A^*xyX^*xyA^*\setminus A^*xyX^+\setminus X^+xyA^*\setminus X^*\), is a maximal synchronous code. Then the pair \((xy,xy)\) is the synchronizing pair for \(X\cup V\). The above construction preserves the rationality of \(X\). It is also proved that each maximal synchronous code is a maximal one. Some examples of another interesting properties are given.

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

• Completing codes
• Each regular code is included in a maximal regular code
• Extended synchronizing codewords for q-ary complete prefix codes
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• 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)

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

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)