On the construction of maximal prefix-synchronized codes

DOI10.1109/18.556604MaRDI QIDQ4336396zbMATH OpenOpenAlexFDO

Authors

Publication date 12 June 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.556604

zbMATH Keywords

synchronizationFibonacci codescomma-free codesrunlength-limited codesprefix-synchronized codemaximal prefix-synchronized codeMPS-codePS-code

Mathematics Subject Classification ID

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

Recommendations

• Partial-prefix synchronizable codes
• On synchronizable and PSK-synchronizable block codes
• On codeword lengths guaranteeing synchronization
• Synchronization methods for block codes
• Extended synchronizing codewords for \(q\)-ary complete prefix codes

Cited in

(14)

• T-shift synchronization codes
• Extended synchronizing codewords for \(q\)-ary complete prefix codes
• Border correlation of binary words
• On maximal synchronous codes.
• On the number of frames in binary words
• On synchronizable and PSK-synchronizable block codes
• scientific article; zbMATH DE number 3478748 (Why is no real title available?)
• T-shift synchronization codes
• Partial-prefix synchronizable codes
• Periodic prefix-synchronized codes: A generating function approach
• Periods in extensions of words
• Synchronization methods for block codes
• On the construction of statistically synchronizable codes
• On the Mean Number of Stuffing Bits in a Prefix-Synchronized Code

This page was built for publication: On the construction of maximal prefix-synchronized codes

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