Journal Papers

(a) Publications in International Journals: SUMMARY

  1. Smarajit Das and B. Sundar Rajan,
    ''Low-delay, High-rate Non-square Complex Orthogonal Designs,''
    IEEE Transactions on Information Theory, (Accepted for publication).
  2. Pritam Som, Tanumay Datta, N. Srinidhi, A. Chockalingam, and B. Sundar Rajan,
    ``Low-Complexity Detection in Large-Dimension MIMO-ISI Channels Using Graphical Models''
    IEEE Journal of Selected Topics in Signal Processing: Special issue on Soft Detection for Wireless Transmission,
    VOL. 5, NO. 8, Dec. 2011, pp. 1497-1511.
  3. Lakshmi Prasad Natarajan and B. Sundar Rajan,
    ''Low ML Decoding Complexity STBCs via Codes over the Klein Group,''
    IEEE Transactions on Information Theory, Vol. 57, No. 9, Dec. 2011, pp. 7950-7971.
  4. K. Pavan Srinath and B. Sundar Rajan,
    ``A Low ML-decoding Complexity, Full-diversity, Full-rate MIMO Precoder,''
    IEEE Transactions on Signal Processing, VOL. 59, NO. 11, Nov. 2011, pp. 5485-5498.
  5. Lakshmi Prasad Natarajan and B. Sundar Rajan,
    ''Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part I: Full-diversity criterion,''
    IEEE Transactions on Wireless Communications,, VOL. 10, NO. 9, September 2011, pp.3032-3041.
  6. Lakshmi Prasad Natarajan and B. Sundar Rajan,
    ''Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part II: Code Construction,''
    IEEE Transactions on Wireless Communications,, VOL. 10, NO.9, September 2011, pp. 3042-3052.
  7. N.Srinidhi, Tanumay Datta, A. Chockalingam, and B. Sundar Rajan,
    ''Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance,''
    IEEE Transactions on Communications, VOL. 59, NO. 11, November 2011, pp. 2955-2963.
  8. K. Pavan Srinath and B. Sundar Rajan,
    ``Generalized Silver Codes,''
    IEEE Transactions on Information Theory, Vol. 57, No. 9, Sept. 2011, pp. 6134-6147.
  9. J. Harshan, Are Hj{\o}rungnes and B. Sundar Rajan,
    ``Training-Symbol Embedded, High-Rate, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks,''
    IEEE Transactions on Information Theory, Vol. 57, No. 9, Sept. 2011, pp. 6157-6169.
  10. Sanjay Karmakar, K. Pavan Srinath and B. Sundar Rajan,
    ``Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs,''
    IEEE Transactions on Information Theory, Vol. 57, No. 9, Dec. 2011, pp. 7972-7981.
  11. J. Harshan and B. Sundar Rajan,
    ``On Two-User Gaussian Multiple Access Channels with Finite Input Constellations,''
    IEEE Transactions on Information Theory, Vol. 57, No. 3, March 2011, pp.1299-1327.
  12. T.Dutta, N.Srinidhi, A. Chockalingam, and B. Sundar Rajan,
    ''Random-Restart Reactive Tabu Search Algorithm for Detection in Large-MIMO Systems,''
    IEEE Communications Letters, Volume: 14, Issue: 12, Pages: 1107-1109, Dec' 2010.
  13. G. Susinder Rajan and B. Sundar Rajan,
    ``Multi-group ML Decodable Collocated and Distributed Space Time Block Codes,''
    IEEE Transactions on Information Theory, Vol.56, No.7, July 2010, pp. 3221-3247.
  14. Harshan J. and B. Sundar Rajan,
    ``Distributed Space-Time Block Codes for Two-Hop Wireless Relay Networks,''
    Journal of Communications, Special issue on "Coding and Modulation for Cooperative Communications"
    Academy Publisher, Vol. 5, No. 4, April 2010, pp.282-296.
  15. K. Pavan Srinath and B. Sundar Rajan,
    ``Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2x2 and 4x2 MIMO Systems,''
    IEEE Journal of Selected Topics in Signal Processing: Special issue on Managing Complexity in Multiuser MIMO Systems,
    Vol. 3, No. 6, Dec. 2009, pp. 916-927.
  16. Saif K. Mohammed, Ahmed Zaki, A. Chockalingam and B. Sundar Rajan,
    ``High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Channel Estimation ,''
    IEEE Journal of Selected Topics in Signal Processing: Special issue on Managing Complexity in Multiuser MIMO Systems,
    Vol. 3, No. 6, Dec. 2009, pp. 958-974.
  17. Sanjay Karmakar and B. Sundar Rajan,
    ``High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras,''
    IEEE Transactions on Information Theory, Vol. 55, No. 06, Jun. 2009, pp. 2682-2695.
  18. D. Sreedhar, A. Chockalingam, and B. Sundar Rajan,
    ''Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks''
    IEEE Transactions on Wireless Communications, Vol. 8, No. 5, pp. 2672-2681, May 2009.
  19. Harshan J. and B. Sundar Rajan,
    ``High-Rate, Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks,''
    IEEE Transactions on Information Theory, Vol. 55, No. 05, May. 2009, pp. 2004-2015.
  20. G. V. R. Muni Kumar and B. Sundar Rajan,
    ``Low PAPR square STBCs from Complex Partial-Orthogonal Designs (CPODs)''
    IEEE Transactions on Wireless Communications, Vol. 8, No. 5, pp. 2369-2378, May 2009.
  21. Harshan J. and B. Sundar Rajan,
    ``Co-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks,''
    IEEE Transactions on Wireless Communications, Vol. 8, No. 4, pp. 1783-1791, April 2009.
  22. G. Susinder Rajan and B. Sundar Rajan,
    ``Leveraging Coherent Distributed Space-Time Codes for Noncoherent Communication in Relay Networks via Training,''
    IEEE Transactions on Wireless Communications, Vol.8, No. 02, Feb. 2009, pp. 683-688.
  23. Smarajit Das and B. Sundar Rajan,
    ``Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity,''
    IEEE Transactions on Wireless Communications, Vol.8, No. 01, Jan. 2009, pp. 204-213.
  24. Sanjay Karmakar and B. Sundar Rajan,
    ``Multigroup-Decodable STBCs from Clifford Algebras,''
    IEEE Transactions on Information Theory, Vol. 55, No. 01, Jan. 2009, pp. 223-231.
  25. V. Shashidhar, B. Sundar Rajan and P. Vijay Kumar,
    ``Asymptotic-Information-Lossless Designs and Diversity-Multiplexing tradeoff,''
    IEEE Transactions on Information Theory, Vol. 55, No. 01, Jan. 2009, pp. 255-268.
  26. Harshan J. and B. Sundar Rajan,
    ``A Non-differential Distributed Space-Time Coding for Partially-Coherent Cooperative Communication,''
    IEEE Transactions on Wireless Communications, Vol. 7, No. 11, Nov. 2008, pp.4076-4081.
  27. K. Vishnu Vardhan, Saif K. Mohammed, A. Chockalingam and B. Sundar Rajan,
    `` A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems,''
    IEEE Journal on Selected Areas in Communications, Vol.26, No.3, April 2008, pp.473-485.
  28. G. Susinder Rajan and B. Sundar Rajan,
    ``Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity,''
    IEEE Transactions on Wireless Communications, Vol. 7, No. 10, October 2008, pp.3962-3971.
  29. G. Susinder Rajan and B. Sundar Rajan,
    `` MMSE Optimal Algebraic Space-Time Codes,''
    IEEE Transactions on Wireless Communications, Vol.7, No.7, July 2008, pp.2468-2472.
  30. Kiran T. and B. Sundar Rajan,
    `` Partially-coherent distributed space-time codes with differential encoder and decoder,''
    IEEE Journal on Selected Areas in Communications: Special issue on Cooperative Communications and Networking,
    Vol.25, No.2, Feb. 2007, pp.426-433.
  31. V. Shashidhar, B. Sundar Rajan and B. A. Sethuraman,
    ``Information-Lossless Space-Time Block Codes from Crossed-Product Algebras,''
    IEEE Transactions on Information Theory, Vol.52, No.9, Sept., 2006, pp.3913-3935.
  32. Rahul Vaze and B. Sundar Rajan,
    ``On Space-Time Trellis codes achieving optimal diversity multiplexing tradeoff,''
    IEEE Transactions on Information Theory, Vol.52, No.11, Nov., 2006.
  33. Zafar Ali Khan and B. Sundar Rajan,
    ``Single-Symbol Maximum-Likelihood Decodable Linear STBCs,''
    IEEE Transactions on Information Theory, Vol.52, No.5, May 2006, pp.2062-2091.
  34. G.Viswanath and B. Sundar Rajan,
    "Matrix characterization of linear codes with arbitrary Hamming weight hierarchy,"
    Linear Algebra and its Applications , Vol.412, 2006, 396-407.
  35. Kiran T. and B. Sundar Rajan,
    ``STBC-schemes with non-vanishing determinant for certain number of transmit antennas,''
    IEEE Transactions on Information Theory, Vol.51, No.8, pp.2984-2992, August 2005.
  36. Bikash Kumar Dey and B. Sundar Rajan,
    "$F_q$-linear Cyclic Codes over $F_{q^m}$: DFT Approach,"
    Designs, Codes and Cryptography, Vol.34, No.1, pp.89-116, Jan. 2005.
  37. Bikash Kumar Dey and B. Sundar Rajan,
    ``Codes Closed under arbitrary Abelian Group of Permutations,''
    SIAM Journal of Discrete Mathematics, Vol.18, No.1, 2004, pp.1-18.
  38. Bikash Kumar Dey and B. Sundar Rajan,
    ``Affine Invariant Extended Cyclic Codes over Galois Rings,''
    IEEE Transactions on Information Theory, Vol.50, No.4, April. 2004, pp.691-698.
  39. Kiran T. and B. Sundar Rajan,
    ``Consta-Abelian Codes Over Galois Rings,''
    IEEE Transactions on Information Theory, Vol.50, No.2, Feb. 2004, pp.367-380.
  40. Md. Zafar Ali Khan and B. Sundar Rajan,
    ``A Generalization of some results on Orthogonal Designs for STBCs,''
    IEEE Transactions on Information Theory, Vol.50, No.1, January 2004, pp.218-219.
  41. B. A. Sethuraman, B. Sundar Rajan and V. Shashidhar,
    ``Full-diversity, High-rate Space-Time Block Codes from Division Algebras,''
    IEEE Transactions on Information Theory, Special Issue on Space-Time Transmission, Reception, Coding and Signal Design, Vol.49, No.10, October, 2003, pp.2596-2616.
  42. Kiran T. and B. Sundar rajan,
    ``Abelian Codes Over Galois Rings Closed Under Certain Permutations,''
    IEEE Transactions on Information Theory, Vol.49, No.9, September 2003, pp.2242-2253.
  43. Bikash Kumar Dey and B. Sundar Rajan,
    "DFT Domain Characterization of Quasi-Cyclic Codes,"
    Applicable Algebra in Engineering, Communication and Computing, Vol.13, pp.453-474, 2003, Springer-Verlag.
  44. G.Viswanath and B. Sundar Rajan,
    "A matrix characterization of Near-MDS codes,"
    ARS Combinatoria, , Vol.79, pp.289-294, 2006.
  45. B. Sundar Rajan and G. Viswanath
    "On Asymptotic Elias Bound for Euclidean Space Codes over Distance-Uniform Signal Sets,"
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science ,
    Vol. E86-A, No.2, Feb. 2003, pp.480-486.
  46. Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh and B. Sundar Rajan,
    ``On Viewing Block Codes as Finite Automata,''
    Journal of Theoretical Computer Science, Vol.290, 2003, pp.1775-1797.
  47. B. Sundar Rajan and Moon Ho Lee,
    "Quasi-Cyclic Dyadic Codes in the Walsh-Hadamard Transform Domain,"
    IEEE Transactions on Information Theory Vol.48, No.8, Aug.2002, pp.2406-2412.
  48. B. Sundar Rajan, L. Venkata Subramaniam and R. Bahl,
    "Gilbert-Varshamov Bound for Euclidean Space Codes over Distance-Uniform Signal Sets,"
    IEEE Transacftions on Information Theory Vol.48, No.2, Feb. 2002, pp.537-546.
  49. M. H. Lee, B. Sundar Rajan and J. Y. Park,
    "A Generalized Reverse Jacket Transform,"
    IEEE Transactions on Circuits and Systems-II:Analog and Digital Signal Processing,
    Vol.48, No.7, July 2001, pp.684-690.
  50. L. Venkata Subramaniam, B. Sundar Rajan and R. Bahl,
    "Performance of 4 and 8-state TCM Schemes with Asymmetric 8-PSK in fading channels,"
    IEEE Transactions on Vehicular Technology, Vol.49(1), Jan.2000, pp.211-219.
  51. T. V. Selvakumaran and B. Sundar Rajan,
    "Block Coded modulation using two-level group codes over generalized Quaternion groups,"
    IEEE Transactions on Information Theory, Vol.45, No.1, 1999, pp.365-372.
  52. J. Bali and B. Sundar Rajan,
    "Block coded PSK modulation using two-level group codes over dihedral groups",
    IEEE Transactions on Information Theory, Vol.44, No.4, July 1998, pp.1620-31.
  53. A. A. Zain and B. Sundar Rajan,
    "Quasideterminant characterization of MDS group codes over Abelian groups,"
    Designs, Codes and Cryptography, Kluwer Academic Publishers, Vol.13, No.3,1998, pp.313-330.
  54. A. A. Zain and B. Sundar Rajan,
    "Dual Codes of Systematic Group Codes over Abelian Groups,"
    Applicable Algebra in Engineering, Communication and Computing, Springer-Verlag, Vol.8, No.1, 1997, pp.71-83.
  55. V. V. Vazirani, Huzur Saran and B. Sundar Rajan,
    "An efficient algorithm for constructing minimal trellises for codes over finite abelian groups,"
    IEEE Transactions on Information Theory, (Special issue on Coding and Complexity), Vol.42, No.6, 1996, pp.1839-1854.
  56. A. A. Zain and B. Sundar Rajan,
    "Algebraic Characterization of MDS Group Codes over Cyclic Groups,"
    IEEE Transactions on Information Theory, Vol.41, No.6, 1995, pp.2052-2090.
  57. B. Sundar Rajan and M. U. Siddiqi,
    "A Generalized DFT for Abelian Codes over $Z_m$,"
    IEEE Transactions on Information Theory, Vol.40, No.6, 1994, pp.2082-2090.
  58. B. Sundar Rajan and M. U. Siddiqi,
    "Transform Domain Characterization of Cyclic Codes over $Z_m$,"
    Applicable Algebra in Engineering, Communication and Computing, Springer-Verlag, Vol.5, No.5, 1994, pp.261-275.
  59. B. Sundar Rajan and M. U. Siddiqi,
    "Transform Decoding of BCH Codes over $Z_m$,"
    International Journal of Electronics, Vol.75, No.6, 1993, pp.1043-1054.
  60. B. Sundar Rajan and M. U. Siddiqi,
    "Transform Domain Characterization of Abelian Codes,"
    IEEE Transactions on Information Theory, Vol.38, No.6, Nov.1992, pp.1817-1821.

    (b) Publications in LNCS (Lecture Notes in Computer Science):

  61. Bikash Kumar Dey and B. Sundar Rajan,
    ``$F_q$-linear codes over $F_{q^m}$: Transform Approach,''
    2001 AAECC-14 Symposium (Applied Algebra, Algorithms, and Error Correcting Codes), RMIT University, Melbourne, Australia, Nov.26-30, 2001.
    Lecture Notes in Computer Science, LNCS Vol. 2227, pp.67-76.
  62. Priti Shankar, K. Sasidharan, Vikas Aggarwal and B. Sundar Rajan,
    "A Package for the Implementation of Block Codes as Finite Automata,"
    Proc. International Conference on Implementation and Application of Automata (CIAA 2000), July 24-25, Ontario, Canada.
    Lecture Notes in Computer Science, LNCS Vol. 2088, pp.279-292.
  63. Kaustubh Deshmuck, Priti Shankar, Amitava Das Gupta and B. Sundar Rajan,
    "On the Many Faces of Block Codes,"
    Proceedings: STACS 2000, 17th International Symposium on Theoretical Aspects of Computer Science, Feb. 17-19, Lille-France, 2000,
    Lecture Notes in Computer Science, LNCS Vol. 1770, pp.53-64.
  64. Priti Shankar, P. N. A. Kumar, Harmeet Singh and B. Sundar Rajan,
    "Minimal Tail-Biting trellises for certain block codes are easy to construct,"
    The 28th International Colloquium on Aotomata, Languages and Programming, (ICALP 2001), Crete, Greece, July 8-12, 2001.
    Lecture Notes in Computer Science, LNCS Vol.2076, pp.627-638.

    (c) Publications in National Journals:

  65. J. Bali and B. Sundar Rajan,
    "Rotational Invariance of Two-Level Group Codes over Dihedral and Dicyclic Groups,"
    Sadhana, Academy Proceedings in Engineering Science, Indian Academy of Sciences, Vol.23(99), Part-I, Feb.1998, pp.45-56.
  66. Paul P, Pradeep CR and B. Sundar Rajan,
    ``On the PAPR of cosets of linear codes,''
    Indian Journal of Pure \& Applied Mathematics, Volume: 39, Issue: 1, Pages: 69-86, Feb. 2008.