Extended synchronizing codewords for binary prefix codes

DOI10.1109/18.490560MaRDI QIDQ4887075zbMATH OpenOpenAlexFDO

Authors Wai-Man Lam, Sanjeev R. Kulkarni

Publication date 28 April 1997

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

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

zbMATH Keywords

prefix codesvariable-length codessynchronizing

Mathematics Subject Classification ID

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

Recommendations

• Extended synchronizing codewords for q-ary complete prefix codes
• The synchronization of variable-length codes
• On codeword lengths guaranteeing synchronization

Cited in

(6)

• A scheme for the synchronization of variable length codes
• Extended synchronizing codewords for q-ary complete prefix codes
• Synchronization recovery of variable-length codes
• On a simple method for detecting synchronization errors in coded messages
• Partial-prefix synchronizable codes
• Binary Huffman equivalent codes with a short synchronizing codeword

This page was built for publication: Extended synchronizing codewords for binary prefix codes

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