A scheme for the synchronization of variable length codes

DOI10.1016/S0166-218X(99)00196-1MaRDI QIDQ1975375zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 28 July 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00196-1

zbMATH Keywords

decoding algorithmssynchronizationvariable length codes

Mathematics Subject Classification ID

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

Recommendations

• The synchronization of variable-length codes
• Extended synchronizing codewords for binary prefix codes
• On the characterization of statistically synchronizable variable-length codes
• scientific article; zbMATH DE number 3478748

Cites work

• Binary Huffman equivalent codes with a short synchronizing codeword
• Construction of minimum-redundance codes with an optimum synchronizing property
• Extended synchronizing codewords for binary prefix codes
• scientific article; zbMATH DE number 781546 (Why is no real title available?)
• Self-synchronizing Huffman codes (Corresp.)

Cited in

(5)

• Synchronization of isolated words of SMD codes in noise
• On codeword lengths guaranteeing synchronization
• On the characterization of statistically synchronizable variable-length codes
• Algorithm for creating (M−1) selfsynchronising M-ary variable length codes
• The synchronization of variable-length codes

This page was built for publication: A scheme for the synchronization of variable length codes

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