biography  research  projects  publications  courses  students  home 
MICHELLE EFFROS: 
PUBLICATIONS 

: 
DATA COMPRESSION LAB Joint
Source and Channel Coding
(highlighted)

[1] S. Ray, M. Effros, M. Medard, T. Ho, D. Karger, R. Koetter, and J. Abounadi. On separation, randomness, and linearity for network codes over finite fields. IEEE Transactions on Information Theory, 2003. Invited paper. Submitted 2004. [2] H. Feng, M. Effros, and S. A. Savari. Functional source coding for networks with receiver side information. In Proceedings of the Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 2004. IEEE. To appear. [3] M. Effros and L. Schulman. Rapid nearoptimal vq design with a deterministic data net. In Proceedings of the IEEE International Symposium on Information Theory, page 298, Chicago, June 2004. IEEE. [4] A.F. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros. Capacity of wireless erasure networks. IEEE Transactions on Information Theory, 2004. In review. [5] M. Effros, H. Feng, and K. Zeger. Suboptimality of the KarhunenLoeve transform for transform coding. IEEE Transactions on Information Theory, 50(8):16051619, August 2004. [6] M. Fleming, Q. Zhao, and M. Effros. Network vector quantization. IEEE Transactions on Information Theory, 50(8):15841604, August 2004. [7] M. Fleming. On source coding for networks. Ph.D. dissertation, California Institute of Technology, Pasadena, CA, 2002. [8] D. Dugatkin. Optimization of multiresolution source codes. Ph.D. dissertation, California Institute of Technology, Pasadena, CA, 2004. [9] T. Ho, B. Leong, M. Medard, R. Koetter, Y. Chang, and M. Effros. On the utility of network coding in dynamic enviornments. In International Workshop on Wireless Adhoc Networks (IWWAN), June 2004. Winner, Best Student Paper Award. [10] T. Coleman, A.Lee, M. Medard, and M. Effros. A new sourcesplitting approach to the SlepianWolf problem. In Proceedings of the IEEE International Symposium on Information Theory, page 332, Chicago, June 2004. IEEE. [11] R. Gowaikar, A. F. Dana, R. Palanki, B. Hassibi, and M. Effros. On the capacity of wireless erasure networks. In Proceedings of the IEEE International Symposium on Information Theory, page 401, Chicago, June 2004. [12] T. Ho, B. Leong, M. Medard, R. Koetter, and M. Effros. Distributed random network coding vs. routing in multiinput multicast networks. Hong Kong, March 2004. IEEE. In review. [13] S. Jaggi and M. Effros. Communication and distribution complexity of joint probability mass functions. In Proceedings of the IEEE International Symposium on Information Theory, page 365, Chicago, June 2004. IEEE. [14] S. Ray, M. Medard, M. Effros, and J. Abounadi. Maximum loss in sum rate due to sourcechannel separation failure for multiple access channels over the binary field. In Proceedings of the IEEE International Symposium on Information Theory, Chicago, June 2004. [15] Q. Zhao and M. Effros. Uniquely decodable multiple access source codes. In Proceedings of the IEEE International Symposium on Information Theory, page 195, Chicago, June 2004. [16] T. Ho, M. Medard, M. Effros, J. Shi, and R. Koetter. Toward a random operation of networks. IEEE Transactions on Information Theory, 2004. [17] T. P. Coleman, A. H. Lee, M. Medard, and M. Effros. On some new approaches for practical SlepianWolf compression inspired by channel coding. In Proceedings of the Data Compression Conference, pages 282291, Snowbird, UT, March 2004. IEEE. [18] Q. Zhao, H. Feng, and M. Effros. Multiresolution source coding using entropy constrained dithered scalar quantization. In Proceedings of the Data Compression Conference, pages 2231, Snowbird, UT, March 2004. [19] T. Ho, M. Medard, M. Effros, and R. Koetter. Network coding for correlated sources. In Conference on Information Sciences and Systems (CISS), Princeton, NJ, March 2004. [20] R. Koetter, M. Effros, T. Ho, and M. Medard. Network codes as codes on graphs. In Conference on Information Sciences and Systems (CISS), Princeton, NJ, March 2004. [21] A. Dana, R. Gowaikar, B. Hassibi, and M. Effros M. Medard. Should we break a wireless network into subnetworks? In 41st Allerton Annual Conference on Communications, Control, and Computing, Monticello, IL, October 2003. IEEE. [22] T. Ho, M. Medard, M. Effros, and D. Karger. On randomized network coding. In 41st Allerton Annual Conference on Communications, Control, and Computing, Monticello, IL, October 2003. IEEE. [23] M. Medard, M. Effros, T. Ho, and D. Karger. On coding for nonmulticast networks. In 41st Allerton Annual Conference on Communications, Control, and Computing, Monticello, IL, October 2003. IEEE. [24] Q. Zhao. Network Source Coding: Theory and Code Design for Broadcast and Multiple Access Networks.Ph. D. Dissertation, California Institute of Technology, Pasadena, CA, 2003. [25] S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen. Polynomial time algorithms for network code construction. 2003. Submitted to IEEE Transactions on Information Theory June 2003. [26] H. Feng and M. Effros. On the achievable region for multiple description source codes on Gaussian sources. In Proceedings of the IEEE International Symposium on Information Theory, page 195, Yokohama, Japan, June 2003. IEEE. [27] M. Fleming and M. Effros. Ratedistortion with mixed types of side information. In Proceedings of the IEEE International Symposium on Information Theory, page 144, Yokohama, Japan, June 2003. IEEE. [28] T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. In Proceedings of the IEEE International Symposium on Information Theory, page 442, Yokohama, Japan, June 2003. IEEE. [29] H. Feng and M. Effros. Improved bounds for the rate loss of multiresolution source codes. IEEE Transactions on Information Theory, 49(4):809821, April 2003. [30] M. Effros, M. Medard, T. Ho, S. Ray, D. Karger, and R. Koetter. Linear network codes: a unified framework for source, channel, and network coding. In Proceedings of the DIMACS Workshop on Network Information Theory, Piscataway, NJ, March 2003. IEEE. Invited paper. [31] M. Effros, H. Feng, and K. Zeger. Suboptimality of the KL transform for transform coding. In Proceedings of the Data Compression Conference, pages 293302, Snowbird, UT, March 2003. IEEE. [32] H. Feng, Q. Zhao, and M. Effros. Network source coding using entropy constrained dithered quantization. In Proceedings of the Data Compression Conference, pages 427436, Snowbird, UT, 2003. IEEE. [33] Q. Zhao and M. Effros. Low complexity code design for lossless and nearlossless side information source codes. In Proceedings of the Data Compression Conference, pages 312, Snowbird, UT, March 2003. IEEE. [34] D. Muresan and M. Effros. Quantization as histogram segmentation: globally optimal scalar quantizer design in network systems. IEEE Transactions on Information Theory, 2003. In review. [35] Q. Zhao and M. Effros. Lossless and nearlossless source coding for multiple access networks. IEEE Transactions on Information Theory, 49(1):112128, January 2003. [36] Q. Zhao, S. Jaggi, and M. Effros. Multiple access source coding: low complexity design and source independence. In Conference Record, ThirtyThird Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, October 2002. IEEE. Invited paper. [37] H. Feng. Rate loss of network source codes. Ph.D. dissertation, California Institute of Technology, Pasadena, CA, 2002. [38] H. Feng and M. Effros. On the rate loss of multiple description source codes and additive successive refinement codes. In Proceedings of the IEEE International Symposium on Information Theory, page 94, Lausanne, Switzerland, June 2002. IEEE. [39] S. Jaggi and M. Effros. Universal multiple access source coding. 2002. Submitted IEEE Transactions on Information Theory June 2002. [40] S. Jaggi and M. Effros. Universal linked multiple access source codes. In Proceedings of the IEEE International Symposium on Information Theory, page 95, Lausanne, Switzerland, June 2002. IEEE. [41] H. Feng and M. Effros. On the rate loss of multiple description and multiple access source codes. Submitted to IEEE Transactions on Information Theory, May 2002. [42] M. Effros, K. Visweswariah, S. Kulkarni, and S. Verdu. Universal lossless source coding with the Burrows Wheeler transform. IEEE Transactions on Information Theory, 48(5):10611081, May 2002. [43] M. Effros and D. Muresan. Codecell contiguity in optimal scalar quantizers. In Proceedings of the Data Compression Conference, pages 312321, Snowbird, UT, March 2002. [44] D. Muresan and M. Effros. Quantization as histogram segmentation: globally optimal scalar quantizer design in network systems. In Proceedings of the Data Compression Conference, pages 302311, Snowbird, Utah, March 2002. [45] H. Feng and M. Effros. A KLT can be arbitrarily worse than the optimal transform for transform coding. In Proceedings of the Conference on Information Sciences and Systems, 2002. [46] D. Dugatkin, H.M. Zhou, T.F. Chan, and M. Effros. Lagrangian optimization of the group testing for wavelets algorithm. In Proceedings of the Conference on Information Sciences and Systems, Princeton, NJ, March 2002. [47] H. Feng and M. Effros. On the ratedistortion performance and computational efficiency of the Karhunen Loeve transform for lossy data compression. IEEE Transactions on Image Processing, 11(2):113122, February 2002. [48] Q. Zhao and M. Effros. Lossless and near lossless source coding for multiple access networks. U.S. Patent Application. Provisional application filed January 2001. NonProvisional application filed January 2002. In review. [49] M. Effros. Universal multiresolution source codes. IEEE Transactions on Information Theory, 47(6):21132129, September 2001. [50] H. Feng and M. Effros. Improved bounds for the rate loss of multiresolution source codes. In Proceedings of the IEEE International Symposium on Information Theory, page 193, Washington, D.C., June 2001. IEEE. [51] Q. Zhao and M. Effros. Lossless source coding for multiple access networks. In Proceedings of the IEEE International Symposium on Information Theory, page 285, Washington, D.C., June 2001. IEEE. [52] M. Fleming and M. Effros. Network vector quantization. In Proceedings of the Data Compression Conference, pages 1322, Snowbird, UT, March 2001. IEEE. [53] Q. Zhao and M. Effros. Optimal code design for lossless and nearlossless source coding in multiple access networks. In Proceedings of the Data Compression Conference, pages 263272, Snowbird, UT, March 2001. IEEE. [54] A. J. Goldsmith and M. Effros. The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise. IEEE Transactions on Information Theory, 47(1):219240, January 2001. [55] M. Effros. PPM performance with BWT complexity  a fast and effective data compression algorithm. Proceedings of the IEEE  Special Issue: Lossless Data Compression, 88(11):17031712, November 2000. Invited paper. [56] Y. Shen, A. J. Goldsmith, and M. Effros. Joint design of vector quantizers and RCPC channel codes for rayleigh fading channels. In Global Telecommunications Conference, 2000. GLOBECOM 2000, volume 3, pages 16111615, San Francisco, CA, November 2000. IEEE. [57] M. Effros and D. Dugatkin. Multiresolution vector quantization. IEEE Transactions on Information Theory, 2000. Submitted October 2000. To appear. [58] D. Dugatkin and M. Effros. Setting priorities: a new SPIHTcompatible algorithm for image compression. In Proceedings of SPIE International Symposium on Optical Science and Technology, volume 4119, pages 799805, San Diego, July 2000. SPIE. [59] H. Feng and M. Effros. Multiresolution channel codes. In Proceedings of the IEEE International Symposium on Information Theory, page 487, Sorrento, Italy, June 2000. IEEE. [60] M. Fleming and M. Effros. The rate distortion region for the multiple description problem. In Proceedings of the IEEE International Symposium on Information Theory, page 208, Sorrento, Italy, June 2000. IEEE. [61] M. Effros. PPM performance with BWT complexity: a new algorithm for lossless data compression. In Proceedings of the Data Compression Conference, pages 203212, Snowbird, UT, March 2000. [62] M. Effros. Network source coding. In Proceedings of the 34th Annual Conference on Information Sciences and Systems, Princeton, NJ, March 2000. IEEE. [63] N. Varnica, M. Fleming, and M. Effros. Multiresolution adaptation of the SPIHT algorithm for multiple description coding. In Proceedings of the Data Compression Conference, pages 303312, Snowbird, UT, March 2000. IEEE. [64] Q. Zhao and M. Effros. Lossless and lossy broadcast system source codes: theoretical limits, optimal design, and empirical performance. In Proceedings of the Data Compression Conference, pages 6372, Snowbird, UT, March 2000. IEEE. [65] M. Effros. Workshop report: NSF sponsored workshop on joint sourcechannel coding. http://www.systems.caltech.edu/EE/Faculty/JSCC, October 1999. [66] M. Effros, P. A. Chou, and R. M. Gray. Weighted universal image compression. IEEE Transactions on Image Processing, 8(10):13171329, October 1999. [67] Q. Zhao and M. Effros. Broadcast system source codes: a new paradigm for data compression. In Conference Record, ThirtyThird Asilomar Conference on Signals, Systems and Computers, volume 1, pages 337341, Pacific Grove, CA, October 1999. IEEE. Invited paper. [68] M. Effros. Theory meets practice: universal source coding with the Burrows Wheeler transform. In Proceedings of the Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 1999. IEEE. [69] M. Effros. Distortionrate bounds for fixed and variablerate multiresolution source codes. IEEE Transactions on Information Theory, 45(6):18871910, September 1999. [70] M. Effros. Universal lossless source coding with the Burrows Wheeler transform. In Proceedings of the Data Compression Conference, pages 178187, Snowbird, UT, March 1999. IEEE. [71] H. Feng and M. Effros. Separable Karhunen Loeve transforms for the weighted universal transform coding algorithm. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, volume 5, pages 24352438, Phoenix, Arizona, March 1999. IEEE. [72] M. Fleming and M. Effros. Generalized multiple description vector quantization. In Proceedings of the Data Compression Conference, pages 312, Snowbird, UT, March 1999. IEEE. [73] M. Effros. Universal multiresolution source codes. In Proceedings of the Information Theory Workshop, page 71, Santa Fe, NM, February 1999. IEEE. Invited paper. [74] D. Dugatkin and M. Effros. Multiresolution VQ: parameter meaning and choice. In Conference Record, ThirtyFirst Asilomar Conference on Signals, Systems, and Computers, volume 1, pages 159162, Monterey, CA, November 1998. IEEE. [75] M. Effros. Optimal modeling for complex system design: the lessons of ratedistortion theory. IEEE Signal Processing Magazine, 15(6):5173, November 1998. Invited paper. [76] T. HaiXin, A. J. Goldsmith, and M. Effros. Joint source and channel coding for fading channels. In Conference Record, ThirtyFirst Asilomar Conference on Signals, Systems, and Computers, volume 1, pages 92101, Pacific Grove, CA, November 1998. IEEE. [77] A. J. Goldsmith and M. Effros. Joint design of fixedrate source codes and multiresolution channel codes. IEEE Transactions on Communications, 46(10):13011312, October 1998. [78] M. Effros. Multiresolution source coding theorems. In Proceedings of the IEEE International Symposium on Information Theory, page 226, Cambridge, Massachusetts, August 1998. IEEE. [79] M. Effros and A. J. Goldsmith. Capacity definitions and coding strategies for general channels with receiver side information. In Proceedings of the IEEE International Symposium on Information Theory, page 39, Cambridge, Massachusetts, August 1998. IEEE. [80] M. Effros. Practical multiresolution source coding: TSVQ revisited. In Proceedings of the Data Compression Conference, pages 5362, Snowbird, UT, March 1998. IEEE. [81] M. Effros. Zerotree design for image compression: toward weighted universal zerotree coding. In Proceedings of the IEEE International Conference on Image Processing, Santa Barbara, CA, October 1997. IEEE. [82] A. J. Goldsmith and M. Effros. Iterative joint design of multiresolution source and channel codes. In Proceedings of the IEEE International Conference on Communications, pages 319323, June 1997. [83] A. J. Goldsmith and M. Effros. The capacity region of broadcast channels with memory. In Proceedings of the IEEE International Symposium on Information Theory, page 28, Ulm, Germany, June 1997. [84] M. Effros. Conditional weighted universal source codes: second order statistics in universal coding. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, volume IV, pages 27332736, Munich, Germany, April 1997. IEEE. [85] M. Effros. Robustness to channel variation in source coding for transmission across noisy channels. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, volume IV, pages 29612964, Munich, Germany, April 1997. IEEE. [86] M. Effros. Fast weighted universal transform coding: toward optimal, low complexity bases for image compression. In Proceedings of the Data Compression Conference, pages 211220, Snowbird, UT, March 1997. IEEE. [87] P. A. Chou, M. Effros, and R. M. Gray. A vector quantization approach to universal noiseless coding and quantization. IEEE Transactions on Information Theory, IT42(4):11091138, July 1996. [88] J.F. Cheng, S. Dolinar, M. Effros, and R. J. McEliece. Data expansion with Huffman codes. In Proceedings of the IEEE International Symposium on Information Theory, Whistler, British Columbia, November 1995. [89] P. A. Chou, M. Effros, and R. M. Gray. Universal quantization of parametric sources has redundancy k 2 log n n . In Proceedings of the IEEE International Symposium on Information Theory, Whistler, British Columbia, November 1995. [90] M. Effros and P. A. Chou. Weighted universal transform coding: universal image compression with the KarhunenLoeve transform. In Proceedings of the IEEE International Conference on Image Processing, Washington, D.C., October 1995. IEEE. [91] M. Effros and P. A. Chou. Weighted universal bit allocation: optimal multiple quantization matrix coding. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, volume 4, pages 23432346, Detroit,MI, May 1995. IEEE. [92] M. Effros, P. A. Chou, and R. M. Gray. Variablerate source coding theorems for stationary nonergodic sources. IEEE Transactions on Information Theory, IT40(6):19201925, November 1994. [93] K. O. Perlmutter, S. M. Perlmutter, M. Effros, and R. M. Gray. An iterative joint codebook and classifier improvement algorithm for finitestate vector quantization. In Conference Record of the TwentyEighth Asilomar Conference on Signals, Systems and Computers, volume 1, pages 701705, Pacific Grove, CA, November 1994. IEEE. [94] M. Effros. Universal and adaptive source coding: theory and practice. PhD thesis, Stanford University, Stanford, CA, August 1994. [95] M. Effros, P. A. Chou, and R. M. Gray. Rates of convergence in adaptive universal vector quantization. In Proceedings of the IEEE International Symposium on Information Theory, page 456, Trondheim, Norway, June 1994. IEEE. [96] M. Effros, P. A. Chou, and R. M. Gray. Variablerate source coding theorems for stationary nonergodic sources. In Proceedings of the IEEE International Symposium on Information Theory, page 266, Trondheim, Norway, June 1994. [97] M. Effros, P. A. Chou, and R. M. Gray. Onepass adaptive universal vector quantization. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, pages V625V628, Adelaide, Australia, April 1994. IEEE. [98] M. Effros, P. A. Chou, and R. M. Gray. Variable dimension weighted universal vector quantization and noiseless coding. In Proceedings of the Data Compression Conference, pages 211, Snowbird, UT, March 1994. IEEE. [99] M. Effros, P. A. Chou, E. A. Riskin, and R. M. Gray. A progressive universal noiseless coder. IEEE Transactions on Information Theory, IT40(1):108117, January 1994. [100] B. D. Andrews, M. Effros, P. A. Chou, and R. M. Gray. A meanremoved variation of weighted universal vector quantization for image coding. In Proceedings of the Data Compression Conference, pages 302309, Snowbird, UT, April 1993. IEEE Computer Society. [101] P. A. Chou and M. Effros. Rate and distortion redundancies for source coding with respect to a fidelity criterion. In Proceedings of the IEEE International Symposium on Information Theory, page 53, San Antonio, Texas, January 1993. [102] M. Effros, P. A. Chou, E. A. Riskin, and R. M. Gray. A progressive universal noiseless coder. In Proceedings of the IEEE International Symposium on Information Theory, page 58, Budapest, Hungary, June 1991. IEEE. 