Bikash Kumar Dey

bikash.jpg

Research Interests

  • Information Theory
  • Coding Theory
  • Wireless communication

Courses Offered

  • EE 708 Information Theory and Coding
  • EE 605 Error Correcting Codes
  • EE 703 Digital Message Transmission
  • EE 308 Communication Systems

Academic Background

  • Ph.D. from the Dept. of Elect. Comm. Engg., Indian Institute of Science, Bangalore, India.Feb’99-Jan’03.
  • Master of Engineering in Signal Processing from Indian Institute of Science, Bangalore, India, Aug’97-Jan’99 .
  • Bachelor of Engineering in Electronics and Tele communication Engineering from Bengal Engineering College ( Deemed University ), Howrah, West Bengal, India,Jul’92-Jun’96 .

Work Experience

  • Jan’11-present: Associate Professor, IIT Bombay, India
  • May’05-Jan’11: Assistant Professor, IIT Bombay, India
  • Jun’03-Apr’05:Assistant Professor, IIIT, Hyderabad, India
  • Feb’03-Apr’03:Technical Member, Hellosoft India Pvt. Ltd., Hyderabad, India
  • Aug’96-Jun’97:Hardware Engineer, Wipro Infotech Global R & D, Bangalore, India

Awards and Honours

  • Prof. I. S. N. Murthy Medal from IISc for 1998-99 as the best M.E. student in the combined group of ME ( Regular ) and ME (Integrated) in the department of Electrical Communication Engineering and Electrical Engineering.
  • The Alumni Medal from IISc for the best Ph.D. thesis in the division of Electrical Sciences in 2003-04.

Contact Information

Department of Electrical Engineering
IIT Bombay, Powai
Mumbai 400 076, India
Email : bikash[AT]ee.iitb.ac.in
Phone (Internal(O)) : (0091 22) - 2576 7429
Phone (Internal(R)) : 8429
Office room no: 214B, EE Main Building
Fax: (0091 22) - 25723707

List of Publications

Journal Publications
  1. V. Shah, B. K. Dey, D. Manjunath, ‘Network flows for functions,’ Accepted in IEEE Journal on Selected Areas of Communications - Special Issue on In-Network Computation: Exploring the Fundamental Limits, 2012.
  2. B. K. Dey, S. Jaggi, M. Langberg, A. D. Sarwate, ‘Upper bounds on the capacity of binary channels with causal adversaries,’ Accepted in IEEE Transactions on Information Theory, 2012.
  3. B. K. Dey, S. Jaggi, M. Langberg, ‘Codes against online adversaries, part I: Large alphabets,’ Accepted in IEEE Transactions on Information Theory, 2012.
  4. B. K. Rai, B. K. Dey, ‘On network coding for sum-networks,’ IEEE Transactions on Information Theory, vol. 58, no. 1, January 2012, pp. 50 - 63.
  5. S. T. Aditya, O. Dabeer, B. K. Dey, ‘A Channel Coding Perspective of Collaborative Filtering,’ IEEE Transactions on Information Theory, vol. 57, no. 4, April 2011, pp. 2327 - 2341.
  6. B. K. Dey, D. Manjunath, S. Chakraborty, ‘Estimating Network Link Characteristics using Packet-Pair Dispersion: A Discrete Time Queueing Theoretic Analysis,’ Computer Networks, vol. 55, no. 5, April 2010, Pages 1052 - 1068, 2010.
  7. B. Jagyasi, B. K. Dey, S. N. Merchant, U. B. Desai, ‘An efficient multibit aggregation scheme for multihop wireless sensor networks,’ Eurasip Journal on Wireless Communications and Networking, vol. 2008, pp. 781-785, 2008.
  8. B. G. Jagyasi, B. K. Dey, S. N. Merchant, and U. B. Desai, ‘Weighted aggregation scheme with lifetime-accuracy tradeoff in wireless sensor network,’ International Journal on Information Processing (IJIP), vol. 1, no. 2, pp. 1-9, 2007.
  9. S. Batabyal, B. K. Dey and V. U. Reddy, ‘A code-set for a robust 8.25 Mbps data rate for IEEE 802.11b WLANs,’ IEEE Transactions on Vehicular Technology, Vol. 56, No. 3, May 2007, pp. 1131-1142.
  10. B. K. Dey, ‘On existence of good self-dual quasi-cyclic codes,’ IEEE Transactions on Information Theory, Vol. 50, No. 8, August 2004, pp. 1794-1798.
  11. B. K. Dey and B. S. Rajan, ‘Codes closed under arbitrary abelian group of permutations,’ SIAM Journal of Discrete Mathematics, Vol. 18, No. 1, pp. 1-18, 2004.
  12. B. K. Dey and B. S. Rajan, ‘Affine invariant extended cyclic codes over Galois rings,’ IEEE Transactions on Information Theory, Vol.50, No.4, April 2004, pp.691-698.
  13. B. K. Dey and B. S. Rajan, ‘DFT domain characterization of quasi-cyclic codes,’ Applicable Algebra in Engineering, Communication and Computing, Springer-Verlag, vol. 13, issue 6, pp. 453-474, 2003.
  14. B. K. Dey and B. S. Rajan, ‘$F_q$-linear cyclic codes over $F_{q^m}$: DFT approach,’ Design, Codes and Cryptography, vol. 34, issue 1, pp. 89-116, January 2005.
Archived Conference Proceedings
  1. B. K. Dey and B. S. Rajan, ‘$F_q$-linear cyclic codes over $F_{q^m}$: DFT characterization,’ Proceedings of AAECC-14 (LNCS vol. 2227), pp. 67-76, 2001.
Conference Presentations
  1. K. Iyer, S. R. B. Pillai, B. K. Dey, ‘Power Controlled Adaptive Sum-Capacity in the Presence of Distributed CSI,’ ISITA 2012, Hawaii, USA.
  2. B. K. Dey, S. Jaggi, M. Langberg and A. D. Sarwate, ‘Improved Upper Bounds on the Capacity of Binary Channels with Causal Adversaries,’ ISIT 2012, Boston, USA.
  3. Y. K. Deshpande, S. R. B. Pillai, B. K. Dey, ‘On the Sum Capacity of Multiaccess Block-Fading Channels with Individual Side Information,’ ITW 2011, Paraty, Brazil.
  4. V. Shah, B. K. Dey, D. Manjunath, ‘Efficient Flow Allocation Algorithms for In-Network Function Computation,’ Globecom 2011.
  5. V. Shah, B. K. Dey, D. Manjunath, ‘Network Flows for Functions,’ ISIT 2011.
  6. S. Shenvi, B. K. Dey, ‘A Necessary and Sufficient Condition for Solvability of a $3s/3t$ Sum-network,’ ISIT 2010.
  7. B. K. Dey, S. Jaggi, M. Langberg, A. Sarwate, ‘Coding against delayed adversaries,’ ISIT 2010.
  8. S. Shenvi, B. K. Dey, ‘A simple necessary and sufficient condition for the double unicast problem,’ ICC 2010.
  9. P. Selvam, B. K. Dey, ‘Improved Layering Protocol for Wireless Cooperative Networks,’ ICFCC 2010.
  10. B. K. Rai, B. K. Dey, S. Shenvi, ‘Some bounds on the capacity of communicating the sum of sources,’ ITW 2010, Cairo, Egypt.
  11. M. Kamat, B. K. Dey, U. Desai, S. N. Merchant, ‘Fair scheduling in MIMO broadcast channels,’ WPMC 2009.
  12. B. K. Dey, S. Jaggi, M. Langberg, ‘Codes against Online Adversaries,’ Forty-Seventh Annual Allerton Conference, 2009.
  13. B. K. Rai, B. K. Dey, and A. Karandikar, ‘Some results on communicating the sum of sources over a network,’ NetCod 2009.
  14. B. K. Rai and B. K. Dey, ‘Feasible alphabets for communicating the sum of sources over a network,’ ISIT 2009.
  15. S. T. Aditya, O. Dabeer, and B. K. Dey, ‘A channel coding perspective of recommendation systems,’ ISIT 2009.
  16. M. Langberg, S. Jaggi, B. K. Dey, ‘Binary causal-adversary channels,’ ISIT 2009.
  17. V. Ganwani, B. K. Dey, G. V. V. Sharma, S. N. Merchant, U. B. Desai, ‘Performance analysis of amplify and forward based cooperative diversity in MIMO relay channels,’ VTC 2009-spring.
  18. S. Shenvi, B. K. Dey, S. Jaggi, and M. Langberg, ‘“Real” Slepian-Wolf Codes,’ ISIT 2008.
  19. S. Shintre, S. Katti, S. Jaggi, B. K. Dey, D. Katabi, and M. Medard, ‘“Real” and “Complex” Network Codes: Promises and Challenges,’ in NetCod 2008.
  20. G.Sharma, S. Jaggi, B.K.Dey, ‘Network tomography via network coding,’ ITA 2008.
  21. B. G. Jagyasi, D. Chander, S. N. Merchant, U. B. Desai, and B. K. Dey, ‘MAAS: Multibit Adaptive Aggregation Scheme for Wireless Sensor Networks,’ in Proc. of ICT 2008, 16-18 June 2008, St. Petersburg, Russia.
  22. B. Jagyasi, D. Chander, U. Desai, S. N. Merchant, and B. K. Dey, ‘Blind adaptive distributed detection in multi-hop wireless sensor networks,’ WPMC 2008.
  23. B. G. Jagyasi, U. B. Desai, S. N. Merchant, D. Chander and B. Dey, ‘AdWAS:Adaptive Weighted Aggregation Scheme for Single-hop and Multi-hop Wireless Sensor Network,’ ChinaCom2007-WCN.
  24. B. G. Jagyasi, D. Chander, U. B. Desai, S. N. Merchant and B. K. Dey, ‘On robustness of Adaptive Weighted Aggregation Scheme for wireless sensor network,’ WPMC 2007.
  25. B. G. Jagyasi, B. K. Dey, S. N. Merchant and U. B. Desai, ‘An MMSE based weighted aggregation scheme for event detection using wireless sensor network,’ in Proceedings of EUSIPCO 2006.
  26. B. G. Jagyasi, B. K. Dey, S. N. Merchant, and U. B. Desai, ‘Weighted Aggregation Scheme with lifetime-accuracy tradeoff in wireless sensor network,’ ICISIP 2006, Dec 2006.
  27. S. Batabyal, B. K. Dey and V. U. Reddy, ‘Design of code-set for a robust 8.25 Mbps data rate for IEEE 802.11b wlan,’ in Proc. of IEEE Vehicular Technology Conference, Sept. ‘05, Dallas Texas.
  28. B. K. Dey, ‘On existence of good self-dual quasi-cyclic codes,’ In Proceedings of 2004 IEEE International Symposium on Information Theory, June 27 - July 2, Chicago, USA, p. 184, 2004.
  29. B. K. Dey and B. S. Rajan, ‘An algorithm to determine linearizability of primitive length cyclic group codes over elementary abelian groups,’ in Proceedings of SITA 99, Yuzawa, Niigata, Japan, pp. 591-594, 1999.
  30. B. K. Dey and B. S. Rajan, ‘DFT characterization of minimal quasicyclic codes,’ in Proceedings of International Conference on Communications, Computers & Devices, (ICCCD-2000), IIT Kharagpur, India, pp. 701-704, 2000.
  31. B. K. Dey and B. S. Rajan, ‘DFT domain characterization of quasi-cyclic codes,’ in Proceedings of 2001 IEEE International Symposium on Information Theory, Washington D.C, USA, p.36, 2001.
  32. B. K. Dey and B. S. Rajan, ‘Codes closed under arbitrary abelian group of permutations,’ in Proceedings of 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, p. 201, 2002.
  33. B. K. Dey and B. S. Rajan, ‘Affine invariant extended cyclic codes over Galois rings,’ in Proceedings of 2003 IEEE International Symposium on Information Theory, Yokohama, Japan, p. 160, 2003.
  34. B. K. Dey, V. U. Reddy, and S. Dasgupta, ‘Optimal bases for DMT modulation with zero suffix and pre-detection equalizer,’ in Proc. of SPCOM’99, IISc, Bangalore, India, July 21-24, 1999.
  35. V. U. Reddy, B. K. Dey, and S. Dasgupta, ‘Discrete multitone modulation with least squares inverse channel filtering,’ in Proceedings of 1999 IEEE Int. Conf. on Personal Wireless Comm. (ICPWC’99), Feb. 17-19, Jaypur, India year 1999.
 
Last modified: 2012/12/21 15:08
 
Valid XHTML 1.0 Driven by DokuWiki