Index assignment for multichannel communication under failure

IEEE Transactions on Information Theory

Volumn 48, Issue 10, 2002, Pages 2656-2668

  Berger Wolf, Tanya Y ^a   Reingold, Edward M ^a,b  

^a University of Illinois at Urbana Champaign   (United States)

^b Illinois Institute of Technology   (United States)

Author keywords

Graph bandwidth; Hamming graph; Index assignment; Multiple description; Product of cliques; Quantizers

Indexed keywords

BANDWIDTH; COMPUTER SIMULATION; DIVERSITY RECEPTION; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

MULTICHANNEL COMMUNICATIONS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0036793244     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.802643     Document Type: Article

References (20)

1. J.-C. Batllo and V.A. Vaishampayan, "Multiple description transform codes with an application to packetized speech," in Proc. IEEE Int. Symp. Information Theory, Trondheim, Norway, 1994.
2. S.L. Bezrukov, "Edge isoperimetric problems on graphs," in Graph Theory and Combinatorial Biology, Balatonlelle, Hungary, 1996, pp. 157-197.
3. P.Z. Chinn, J. Chvátalová, A.K. Dewdney, and N.E. Gibbs, "The bandwidth problem for graphs and matrices - A survey," J. Graph Theory, vol. 6, pp. 223-254, 1982.
4. A.A. El Gamal and T.M. Cover, "Achievable rates for multiple descriptions," IEEE Trans. Inform. Theory, vol. IT-28, pp. 851-857, Nov. 1982.
5. L.H. Harper, "Optimal assignments of numbers to vertices," J. SIAM, vol. 12, no. 1, pp. 131-135, Mar. 1964.
6. _, "Optimal numberings and isoperimetric problems on graphs," J. Comb. Theory, vol. 1, pp. 385-393, 1966.
7. U. Henrich and M. Stiebitz, "On the bandwidth of graph products," J. Inform. Processing and Cybern., vol. 28, pp. 113-125, 1992.
8. N.S. Jayant, "Subsampling of a DPCM speech channel to provide two self-contained half-rate channels," Bell Syst. Tech. J., vol. 60, pp. 501-509, 1981.
9. N.S. Jayant and S.W. Christensen, "Effect of packet losses in waveform coded speech and improvements due to odd-even sample interpolation procedure," IEEE Trans. Commun., vol. COM-29, pp. 101-109, Feb. 1981.
10. Y. Lai and K. Williams, "A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs," J. Graph Theory, vol. 31, pp. 75-94, 1999.
11. E.L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
12. L. Ozarow, "On a source coding problem with two channels and three receivers," Bell Syst. Tech. J., vol. 59, pp. 1909-1921, 1980.
13. C.E. Shannon, "Coding theorems for discrete source with fidelity criterion," in IRE Nat. Conv. Rec., vol. 4, 1959, pp. 142-163.
14. V.A. Vaishampayan, "Vector quantizer design for diversity systems," in Proc. 25 Annu. Conf. Information Science Systtems, Johns Hopkins Univ., Baltimore, MD, Mar. 20-22, 1991, pp. 564-569.
15. _, "Design of multiple description scalar quantizers," IEEE Trans. Inform. Theory, vol. 39, pp. 821-834, May 1993.
16. V.A. Vaishampayan and J. Domaszewicz, "Design of entropy-constrained multiple-description scalar quantizers," IEEE Trans. Inform. Theory, vol. 40, pp. 245-250, Jan. 1994.
17. H.S. Witsenhausen and A.D. Wyner, "Source coding for multiple descriptions II: A binary source," Bell Syst. Tech. J., vol. 60, pp. 2281-2292, 1981.
18. J.K. Wolf, A.D. Wyner, and J. Ziv, "Source coding for multiple descriptions," Bell Syst. Tech. J., vol. 59, pp. 1417-1426, 1980.
19. S.-M. Yang and V.A. Vaishampayan, "Low-delay communication for Rayleigh fading channels: An application of the multiple description quantizer," IEEE Trans. Commun., vol. 43, pp. 2771-2783, Nov. 1995.
20. Z. Zhang and T. Berger, "New results in binary multiple description," IEEE Trans. Inform. Theory, vol. IT-33, pp. 502-521, July 1987.