Greedy adaptive Fano coding

IEEE Aerospace Conference Proceedings

Volumn 6, Issue , 2002, Pages 2757-2770

  Rueda, Luis G ^a   Oommen, B John ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BRUTE FORCE ALGORITHMS; CODING METHODS; DECOMPRESSION PHASE; ENCODING AND DECODING; LINEAR-TIME ALGORITHMS; MEMORY CONSTRAINTS; OPTIMAL PARTITIONING; RIGOROUS ANALYSIS;

AEROSPACE ENGINEERING;

CLUSTERING ALGORITHMS;

EID: 84879389285     PISSN: 1095323X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AERO.2002.1036115     Document Type: Conference Paper

References (21)

1. R. Arnold and T. Bell. A Corpus for the Evaluation of Lossless Compression Algorithms, pages 201210, Los Alamitos, CA, 1997. IEEE Computer Society Press.
2. J. Cleary and T. Witten. Data Compression Using Adaptive Coding and Partial String Matching. IEEE Transactions on Communications. 32(4):396-402, 1984. (Pubitemid 14564864)
3. S. Dunn, Visual.!+ + 6.0-Developer's Workshop. Microsoft Press, 1998.
4. N. Faller. An Adaptive System for Data Compression. Seventh Asilomar Conference on Circuits, Systems, and Computers, pages 593-597, 1973.
5. R. Galiager. Variations on a Theme by Huffman. IEEE Transactions on Information Theory, 24(6):668-674, 1978.
6. D, Hankerson, G. Harris, and P. Johnson Jr. introduction to Information Theory and Data Compression. CRC Press, 1998.
7. D.A. Huffman. A Method for the Construction of Minimum Redundancy Codes. Proceedings of RE, 40(9): 1098-1101, 1952.
8. Kevin Ingalls and Daniel Jinguji. Learn Microsoft Visual J++ 6.0Now. Microsoft Press, 1998.
9. J. C. Kieffer and E. Yang. Grammar-Bassed Codes: A new Class of Universal Lossless Source Codes. IEEE Transactions on Information Theory, 46(3):737-754, May 2000.
10. D. Knuth. Dynamic Huffman Coding. Journal of Algorithms, 6:! 63-180, 1985.
11. L. Rueda. New Algorithms for Data Compression and Optimal Pairwise Linear Classification, PhD thesis, School of Computer Science, Carleton University, Ottawa, Canada. In preparation. (Thesis title is tentative).
12. L. Rueda and B. J. Oommen. Enhanced Static Fano Coding. To be presented at the IEEE Conference on Systems, Man, and Cybernetics. Tucson, Arizona. 2001.
13. L. Rueda and B. J. Oommen. Greedy Adaptive Fano Coding for Binary and Multi-Symbol Code Alphabets. (Submited for Publication).
14. L. Rueda and B. J. Oommen. Nearly Optimal Fano-Based Canonical Codes. (Submited for Publication). Also available as a Technical Report TR-01-05, School of Computer Science, Carleton University, Ottawa, Canada, 2001.
15. W. Savitch. Java: An Introduction to Computer Science Programming. Prentice Hall, 1999.
16. K. Sayood, Introduction to Data Compression. Morgan Kaufmann, 2nd. edition, 2000.
17. J. Storer. Data Compression: Methods and Theory. Computer Science Press, 1988.
18. J. Vitter. Design and Analysis of Dynamic Huffman Codes. Journal of the ACM. 34(4):825-845, 1987. (Pubitemid 18521038)
19. I. Witters, A. Moffat, and T. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, 2nd. edition, 1999.
20. J. Ziv and A. Lempel. A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theoiy, 23(3):337-343. 1977.
21. J. Ziv and A. Lempel. Compression of Individual Sequences via Variable-Rate Coding. IEEE Transactions on Information Theory, 25(5):530-536. 1978.