Informed-source coding-on-demand (ISCOD) over broadcast channels

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 1998, Pages 1257-1264

  Birk, Yitzhak ^a   Kol, Tomer ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); ERROR CORRECTION; GRAPH THEORY; INFORMATION DISSEMINATION; NETWORK PROTOCOLS; VOICE/DATA COMMUNICATION SYSTEMS;

BROADCAST CHANNELS; INFORMED SOURCE CODING ON DEMAND ALGORITHMS; MULTICAST FILE TRANSFER PROTOCOL;

ALGORITHMS;

EID: 0031675783     PISSN: 0743166X     EISSN: None     Source Type: None    
DOI: 10.1109/INFCOM.1998.662940     Document Type: Conference Paper

References (28)

1. Backweb homepage http://www.backweb.com
2. Pointcast homepage http://www.pointcast.com
3. Starburst communications homepage http://www.starburstcom.com
4. J. J. Metzner An improved broadcast retransmission protocol IEEE Trans. Commun. 32 6 679 683 1984
5. K. Sakakibara M. Kasahara A multicast hybrid arq scheme using mds codes and gmd decoding IEEE Trans. Commun. 43 12 2933 2940 Dec. 1995
6. A. Shiozaki Adaptive type-ii hybrid broadcast arq system IEEE Trans. Commun. 44 4 420 422 Apr. 1996
7. A. A. El-Gamal T. M. Cover Achievable rates for multiple descriptions IEEE Trans. Inform. Theory 28 6 851 857 Nov. 1982
8. R. W. Yeung Multilevel diversity coding with distortion IEEE Trans. Inform. Theory 41 2 412 422 Mar. 1995
9. N. Alon A. Orlitsky Source coding and graph entropies IEEE Trans. Inform. Theory 42 5 1329 1339 Sept. 1996
10. A. Orlitsky Worst-case interactive communication I: Two messages are almost optimal IEEE Trans. Inform. Theory 36 5 1111 1126 Sept. 1990
11. W. F. King Analysis of paging algorithms IFIP Congresss 485 490 IFIP Congresss 1971
12. D. Buck M. Singhal An analytic study of caching in computer systems Journal of Parallel and Distributed Computing 32 205 214 1996
13. P. Flajolet D. Gardy L. Thimonier Birthday paradox, coupon collectors, caching algorithms and self-organizing search Discrete Applied Mathematics 39 207 229 1992
14. F. Baskett A. Rafii The a0 inversion model of program paging behaviour 1976 CS-76-579 Stanford University
15. K. J. Worrell Invalidation in large scale network object caches 1994 University of Colorado Boulder
16. J. Gwertzman M. Seltzer World-wide web cache consistency Proc. 1996 Usenix Technical conf. Proc. 1996 Usenix Technical conf. San Diego CA 1996-Jan.
17. C. R. Cunha A. Bestavros M. E. Crovella Characteristics of www client-based traces Apr. 1995 BU-CS-95-010 CS Dept. Boston University
18. V. Almeida A. de Oliveira On the fractal nature of www and its application to cache modeling 1996 BU-CS-96-004 CS Dept. Boston University
19. Propogation, replication and caching 1996 W3C http://www.w3.org/pub/www/propogation/activity.html
20. Y. Birk T. Kol Informed-Source Coding-On-Demand (ISCOD) for efficient dispersal of information over a broadcast channel 1997 Electrical Engineering Dept, Technion
21. M. R. Garey D. S. Johnson Computers and Intracability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman
22. Handbook of combinatorics I 1995 Elsevier Science B.V.
23. L. Lovász M. D. Plummer M. Theory Number 29 in Annals of Discrete Mathematics 1986 Elsevier Science B.V.
24. S. Even O. Kariv An o(n2.5) algorithm for maximum matching in general graphs 16th Ann. Symp. on Foundation of Computer Science 100 112 16th Ann. Symp. on Foundation of Computer Science 1975
25. N. Blum A new approach to maximum matching in general graphs International Colloq. Automata Language and Programming 443 586 597 International Colloq. Automata Language and Programming 1990
26. N. Blum A new approach to maximum matching in general graphs June 1994 8546-CS Institut für Informatik der Universität Bonn
27. B. Bollobás Random Graphs 1985 Academic Press
28. S. Janson D. E. Knuth T. Luczak B. Pittel The birth of the giant component