Research Interests:
My primary area of research is coding theory and its applications to solve problems arising in the reliable transmission of information. In my Master's thesis, I designed a multilevel coded modulation scheme for communication over parallel fading channels.

For my Ph.D. dissertation, I am investigating coding techniques for writing on 'dirty paper'. In particular, we consider communication over an additive white Gaussian noise (AWGN) channel with additive interference. In our setup the sender has no knowledge of the interference. However, there exists a helper that is power constrained and has non-causal knowledge of the interference. The helper and the sender do not cooperate. We show that if the helper power exceeds the sum of the signal power and the noise power then the sender can communicate at the rate that equals the capacity of the AWGN channel with no interference. Further, we show that in the limit of arbitrarily large interference power, our scheme achieves within 0.1 bit of the capacity of the channel.

Publications:
S. Mallik and R. Koetter, ``Helpers for Cleaning Dirty Papers,'' to be presented at the Seventh International ITG Conference on Source and Channel Coding (SCC '08), Ulm, Germany. [pdf]

S. Mallik and R. Koetter, ``Multilevel Codes for OFDM-like Modulation over Underspread Channels,'' EURASIP Journal on Applied Signal Processing, vol. 2006, Article ID 97210, 19 pages, 2006. [pdf]

M. Kesal, S. Mallik and R. Koetter, ``Iterative Algorithms for Finding the Stationary Points of the Dirty Tape Problem," Proceedings of the IEEE International Symposium on Information Theory, 2006, pp. 749-753. [pdf]

S. Mallik and R. Koetter, ``Partitioning Techniques for Design of Multilevel Codes for Rayleigh Fading Channels,'' Proceedings of the IEEE International Symposium on Information Theory, 2004, pp. 409. [pdf]

H. Boelcskei, R. Koetter and S. Mallik, ``Coding and Modulation for Underspread Fading Channels'', Proceedings of the IEEE International Symposium on Information Theory, 2002, pp. 358. [pdf]