Self-synchronizing Huffman codes (Corresp.)
From MaRDI portal
Publication:3342438
DOI10.1109/TIT.1984.1056931zbMath0548.94011OpenAlexW2143529460MaRDI QIDQ3342438
Joshua H. Rabinowitz, Thomas J. Ferguson
Publication date: 1984
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1984.1056931
Prefix, length-variable, comma-free codes (94A45) Source coding (94A29) Synchronization error-correcting codes (94B50)
Related Items (16)
Optimal Skeleton Huffman Trees Revisited ⋮ A memory-efficient and fast Huffman decoding algorithm ⋮ Shortest synchronizing strings for Huffman codes ⋮ Optimal synchronous coding ⋮ The use and usefulness of numeration systems ⋮ Robust universal complete codes for transmission and compression ⋮ Optimal skeleton and reduced Huffman trees ⋮ A scheme for the synchronization of variable length codes ⋮ Optimal Skeleton Huffman Trees ⋮ Is Huffmann coding dead? ⋮ Segment-based coding of color images ⋮ Shortest Synchronizing Strings for Huffman Codes ⋮ Forward looking Huffman coding ⋮ Error detection based on MB types ⋮ Synchronizing codewords of \(q\)-ary Huffman codes ⋮ COMPRESSED PATTERN MATCHING IN JPEG IMAGES
This page was built for publication: Self-synchronizing Huffman codes (Corresp.)
