42
Views
0
CrossRef citations to date
0
Altmetric
Miscellany

Optimal synchronous coding

, &
Pages 931-941 | Received 25 Jun 2003, Published online: 25 Jan 2007

References

References

  • Adrin , EE and Perkins , S . (1998) . Binary Huffman equivalent codes with a short synchronizing code word . IEEE Trans. Inform. Theory , 44 : 346 – 351 .
  • Berstel J Perrin D (1985) Theory of Codes, Academic Press Orlando
  • Bell TC Cleary JG Witten IH (1990) Text Compression, Prentice Hall Englewood Cliffs NJ
  • Cover T Thomas J (1991) Elements of Information Theory, Wiley New York
  • Capocelli , RM , Gargano , L and Vaccaro , U . (1988) . On the characterization of statistically synchronizable variable-length codes . IEEE Trans. Inform. Theory , 34 : 817 – 825 .
  • Capocelli , RM , De Santis , AA , Gargano , L and Vaccaro , U . (1988) . On the construction of statistically synchronizable codes . IEEE Trans. Inform. Theory , 34 : 817 – 825 .
  • Ferguson , TJ and Rabinowitz , JH . (1984) . Self-synchronizing huffman codes . IEEE Trans. Inform. Theory , 30 : 687 – 693 .
  • Fraenkel AS Klein ST (1994) Complexity aspects of guessing prefix codes Algorithmica 409 419
  • Gillman , DW , Mohtashemi , M and Rivest , RL . (1996) . On breaking a huffman code . IEEE Trans. Inform. Theory , 42 ( 3 ) : 972 – 976 .
  • Huffman , DA . (1952) . A method for the construction of minimum-redundancy codes . Proc. IRE , 40 : 1098 – 1101 .
  • Hashemian , R . (1995) . Memory efficient and high speed search huffman coding . IEEE Trans. Commun. , 43 ( 10 ) : 2576 – 2581 .
  • rgensen H Konstantinidis S (1997) Codes In: G. Rozenberg, A. Salomaa (Eds.) Handbook of Formal Languages 1 Springer-Verlag Berlin, Heidelberg pp. 511–607
  • Jones , DW . (1988) . Applications of splay trees to data compression . Commun. ACM , 31 : 996 – 1007 .
  • Kahn D (1967) The Codebreakers, Macmillian New York
  • Klein , ST , Bookstein , A and Deerwester , S . (1989) . Storing Text-retrieval systems on CD-ROM: Compression and encryption considerations . ACM Trans. Inform. Syst. , 7 : 230 – 245 .
  • Long D Jia W (2000) The optimal encoding schemes Proc. of 16th World Computer Congress, 2000, International Academic Publishers Beijing pp. 25–28
  • Long D Jia W (2001) Optimal maximal encoding different from huffman encoding Proc. of International Conference on Information Technology: Coding and Computing (ITCC 2001), IEEE Computer Society Las Vegas pp. 493–497
  • Lei , SM and Sun , MT . (1991) . An entropy coding system for digital HDTV applications . IEEE Trans. Circuits Syst. Video Technol. , 1 : 147 – 155 .
  • Lakhani , G and Ayyagari , V . (1995) . Improved Huffman code tables for JPEG's encoder . IEEE Trans. Circuits Syst. Video Technol. , 5 ( 6 ) : 562 – 564 .
  • Linder , T , Tarokh , V and Zeger , K . (1997) . Existence of optimal prefix codes for infinite source alphabets . IEEE Trans. Inform. Theory , 43 ( 6 ) : 2026 – 2028 .
  • Montgomery , BL and Abrahams , J . (1986) . Synchronization of binary source codes . IEEE Trans. Inform. Theory , 32 : 851 – 854 .
  • Pennebaker WB Mitchell JL (1993) JPEG: Still Image Data Compression Standard New York
  • Rubin , F . (1979) . Cryptographic aspects of data compression codes . Cryptologia , 3 : 202 – 205 .
  • Roman S (1996) Introduction to Coding and Information Theory, Springer-Verlag New York
  • tzenberger , MP . (1967) . On synchronizing prefix codes . Inform. Control , 11 : 396 – 401 .
  • tzenberger , MP . (1964) . On the synchronizing properties of certain prefix codes . Inform. Control , 7 : 23 – 36 .
  • Titchener , MR . (1997) . The synchronization of variable-length codes . IEEE Trans. Inform. Theory , 43 : 683 – 691 .
  • Tzou , KH . (1992) . High-order entropy coding for images . IEEE Trans. Circuits Syst. Video Technol. , 2 : 87 – 89 .
  • Vitter , JS . (1987) . Design and analysis of dynamic Huffman codes . J. Assoc. Comput. Mach. , 344 : 825 – 845 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.