Source coding and graph entropies

IEEE Transactions on Information Theory

Volumn 42, Issue 5, 1996, Pages 1329-1339

  Alon, Noga ^b,c   Orlitsky, Alon ^a,b  

^a IEEE

^b NOKIA RESEARCH CENTER   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Amortization; Chromatic entropy; Graph entropy; Source coding

Indexed keywords

DATA COMMUNICATION SYSTEMS; GRAPH THEORY; NETWORK PROTOCOLS; PROBABILITY; RANDOM PROCESSES; SET THEORY;

AMORTIZATION; CHROMATIC ENTROPY; GRAPH ENTROPY; SOURCE CODING;

SIGNAL ENCODING;

EID: 0030241020     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.532875     Document Type: Article

References (18)

1. N. Alon and A. Orlitsky, "A lower bound on the expected length of one-to-one codes," IEEE Trans. Inform. Theory, vol. 38, no. 4, pp. 1670-1672, Sept. 1994.
2. _, "Repeated communication and Ramsey graphs," IEEE Trans. Inform. Theory, vol. 41, no. 5, pp. 1276-1289, Sept. 1995.
3. R. B. Bopana, "Optimal separations between concurrent-write parallel machines," in Proc. 21st Ann. ACM Symp. Theory Comput., 1989, pp. 320-326.
4. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
5. I. Csiszár, J. Körner, L. Lovász, K. Marton, and G. Simonyi, "Entropy Splitting for antiblocking pairs and perfect graphs," Combinatorica, vol. 10, no. 1, pp. 27-40, 1990.
6. T. Feder, E. Kushilevitz, and M. Naor, "Amortized communication complexity," in Proc. 32nd Ann. Symp. Found. Comput. Science, 1991, pp. 239-248.
7. M. L. Fredman and J. Komlós, "On the size of separating systems and families of perfect hash functions,'' SIAM J. Alg. Disc. Meth., vol. 5, no. 1. pp. 61-68, 1984.
8. J. Kahn and J. H. Kim, "Entropy and sorting," in Proc. 24th Ann. ACM Symp. Theory Comput., 1992, pp. 178-187.
9. J. Körner, "Coding of an information source having ambiguous alphabet and the entropy of graphs," in Proc. 6th Prague Conf. on Information Theory, 1973, pp. 411-425.
10. _, "Fredman-Komlós bounds and information theory," SIAM. J. Alg. Disc. Meth., vol. 7, pp. 560-570, 1986.
11. _, personal communication, 1994.
12. J. Körner and K. Marton, "New bounds for perfect hashing via information theory," Eur. J. Combinatorics, vol. 9, pp. 523-530, 1988.
13. I. Newman, P. Ragde, and A. Wigderson, "Perfect hashing, graph entropy, and circuit complexity," in Proc. 5th Ann. Conf. Struc. Complex. Theory, 1991, pp. 91-100.
14. A. Orlitsky, "Worst-case interactive communication I: Two messages are almost optimal," IEEE Trans. Inform. Theory, vol. 36, no. 5, pp. 1111-1126, Sept. 1990.
15. J. Radhakrishnan, "Better bounds for threshold formulas," in Proc. 32nd Ann. Symp. Found. Comp. Sci., Oct. 1991, pp. 314-323.
16. G. Simonyi, "Graph entropy: A survey," in DIMACS Volume on Special Year on Combinatorial Optimization, L. Lovász, P. Seymour, and W. Cook, Eds. New Brunswick, NJ: Rutgers Univ., to appear.
17. H. Witsenhausen, "The zero-error side information problem arid chromatic numbers." IEEE Trans. Inform. Theory, vol. IT-22, no. 5, pp. 592-593, Sept. 1976.
18. A. D. Wyner, "An upper bound on the entropy series," Inform. Contr., vol. 20, pp. 176-181, 1972.