Representing variable-length codes in fixed-length T-Depletion format in encoders and decoders 1 2

Journal of Universal Computer Science

Volumn 3, Issue 11, 1997, Pages 1207-1225

  Günther, Ulrich ^a   Hertling, Peter ^a   Nicolescu, Radu ^a   Titchener, Mark ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Variable length codes*T codes*Encoders*Decoders*Representation

Indexed keywords

EID: 0141880197     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. [Chung 97] K.-L. Chung. Efficient Huffman decoding. Information Processing Letters, 61:97-99, 1997.
2. [Ferguson and Rabinowitz 84] T. J. Ferguson and J. H. Rabinowitz. Self synchronizing Huffman codes. IEEE Trans. Inform. Theory, 30(4):687-693, July 1984.
3. [Gallager 68] R. G. Gallager. Information Theory and Reliable Communications. John Wiley and Sons, Inc, November 1968.
4. [Gilbert 60] E. N. Gilbert. Synchronization of binary messages. IRE Trans. Inform. Theory, 10:933-967, 1960.
5. [Gilbert and Moore 59] E. N. Gilbert and E. F. Moore. Variable length binary encodings. Bell Syst. Tech. J., 38:933-967, July 1959.
6. [Günther 96] U. Günther. Data compression and serial communication with generalized T-Codes. Journal of Universal Computer Science, 2(11):769-795, November 1996.
7. [Günther and Titchener 95] U. Günther and M. R. Titchener. Calculating the expexted synchronization delay for T-Code Sets. IEE Proceedings - Communications, 144:121, June 1997.
8. [Higgle 91] G. R. Higgle. Analysis of the Families of Variable-Length Self-Synchronizing Codes Called T-Codes. PhD thesis, The University of Auckland, 1991.
9. [Higgle 96] G. R. Higgle. Database of best T-Codes. IEE Proceedings, Computers and Digital Techniques, 143:213-218, July 1996.
10. [Hirschberg and Lelewer 90] D. S. Hirschberg and D. A. Lelewer. Efficient decoding of prefix codes. Communications of the ACM, 33(4):449-459, April 1990.
11. [Huffman 52] D. Huffman. A method for the construction of minimum redundancy codes. Proc. Inst. Radio Eng., 40:1098-1101, September 1952.
12. [Montgomery and Abrahams 86] B. L. Montgomery and J. Abrahams. Synchronization of binary source codes. IEEE Trans. Inform. Theory, 32(6):849-854, November 1986.
13. [Nicolescu 95] R. Nicolescu. Uniqueness theorems for T-Codes. Technical Report 9, The University of Auckland, September 1995.
14. [Takishima, Wada and Murakami 94] Y. Takishima, M. Wada, and H. Murakami. Error states and synchronization recovery for variable length codes. IEEE Transactions on Communications, 42(2-4):783-792, February 1994.
15. [Tanaka 87] H. Tanaka. Data structure of Huffman codes and its application to efficient encoding and decoding. IEEE Trans. Inform. Theory, 33(1):154-156, January 1987.
16. [Titchener 85] M. R. Titchener. Construction and properties of the augmented and binary-depletion codes. IEE Proceedings Pt.E, Computers and Digital Techniques, 132(3):163-169, May 1985.
17. [Titchener 95] M. R. Titchener. Generalized T-Codes: an extended construction algorithm for self-synchronizing variable-length codes. IEE Proceedings Pt.E, Computers and Digital Techniques, 143(3):122-128, June 1996.
18. [Titchener and Hunter 85] M. R. Titchener and J. J. Hunter. Synchronization process for the variable-length T-Codes. IEE Proceedings Pt.E, Computers and Digital Techniques, 133(1):54-64, 1985.
19. [Wei and Scholtz 80] V. K. W. Wei and R. A. Scholtz. On the characterization of statistically synchronizable codes. IEEE Trans. Inform. Theory., 26(6):733-735, November 1980.
20. [Zolghadr, Honary and Darnell 89] F. Zolghadr, B. Honary and M. Darnell. Statistical real-time channel evaluation (SRTCE) technique using variable-length T-Codes. IEE Proceedings, 136(4):259-266, August 1989.