3 research outputs found
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
Ahlswede R, Cai N. Two proofs of Pinsker's conjecture concerning arbitrarily varying channels. IEEE transactions on information theory. 1991;37(6):1647-1649
Successive structuring of source coding algorithms for data fusion, buffering, and distribution in networks
Supervised by Gregory W. Wornell.Also issued as Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Includes bibliographical references (p. 159-165).(cont.) We also explore the interactions between source coding and queue management in problems of buffering and distributing distortion-tolerant data. We formulate a general queuing model relevant to numerous communication scenarios, and develop a bound on the performance of any algorithm. We design an adaptive buffer-control algorithm for use in dynamic environments and under finite memory limitations; its performance closely approximates the bound. Our design uses multiresolution source codes that exploit the data's distortion-tolerance in minimizing end-to-end distortion. Compared to traditional approaches, the performance gains of the adaptive algorithm are significant - improving distortion, delay, and overall system robustness.by Stark Christiaan Draper