The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

B. Sundar Rajan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bikash Kumar Dey, B. Sundar Rajan
    Fq-Linear Cyclic Codes over Fq: DFT Characterization. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:67-76 [Conf]
  2. Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan
    An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:144-153 [Conf]
  3. Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. Sundar Rajan
    Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:627-638 [Conf]
  4. Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan
    On the Many Faces of Block Codes. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:53-64 [Conf]
  5. Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan
    A Package for the Implementation of Block Codes as Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2000, pp:279-292 [Conf]
  6. Bikash Kumar Dey, B. Sundar Rajan
    DFT Domain Characterization of Quasi-Cyclic Codes. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2003, v:13, n:6, pp:453-474 [Journal]
  7. B. Sundar Rajan, M. U. Siddiqi
    Transform Domain Characterization of Cyclic Codes over Zm. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:261-275 [Journal]
  8. A. A. Zain, B. Sundar Rajan
    Dual codes of systematic group codes over abelian groups. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1996, v:8, n:1, pp:71-83 [Journal]
  9. A. A. Zain, B. Sundar Rajan
    Quasideterminant Characterization of MDS Group Codes over Abelian Groups. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:13, n:3, pp:313-330 [Journal]
  10. Bikash Kumar Dey, B. Sundar Rajan
    Codes Closed under Arbitrary Abelian Group of Permutations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:1-18 [Journal]
  11. Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh, B. Sundar Rajan
    On viewing block codes as finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1775-1797 [Journal]
  12. Jyoti Bali, B. Sundar Rajan
    Block-Coded PSK Modulation Using Two-Level Group Codes Over Dihedral Groups. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1620-1631 [Journal]
  13. Zafar Ali Khan, B. Sundar Rajan
    A generalization of some existence results on orthogonal designs for STBCs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:1, pp:218-219 [Journal]
  14. Md. Zafar Ali Khan, B. Sundar Rajan
    Single-symbol maximum likelihood decodable linear STBCs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:5, pp:2062-2091 [Journal]
  15. T. Kiran, B. Sundar Rajan
    Abelian codes over Galois rings closed under certain permutations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:9, pp:2242-2253 [Journal]
  16. T. Kiran, B. Sundar Rajan
    Consta-Abelian codes over Galois rings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:367-380 [Journal]
  17. B. Sundar Rajan, Moon Ho Lee
    Quasi-cyclic dyadic codes in the Walsh--Hadamard transform domain. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2406-2412 [Journal]
  18. B. Sundar Rajan, M. U. Siddiqi
    Transform domain characterization of Abelian codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1817-0 [Journal]
  19. B. Sundar Rajan, L. Venkata Subramaniam, Rajendar Bahl
    Gilbert-Varshamov bound for Euclidean space codes over distance-uniform signal sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:2, pp:537-546 [Journal]
  20. T. V. Selvakumaran, B. Sundar Rajan
    Block-Coded Modulation Using Two-Level Group Codes Over Generalized Quaternion Groups. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:365-372 [Journal]
  21. B. A. Sethuraman, B. Sundar Rajan, V. Shashidhar
    Full-diversity, high-rate space-time block codes from division algebras. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:10, pp:2596-2616 [Journal]
  22. B. Sundar Rajan, M. U. Siddiqi
    A generalized DFT for Abelian codes over Zm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:2082-0 [Journal]
  23. Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan
    An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1839-1854 [Journal]
  24. A. A. Zain, B. Sundar Rajan
    Algebraic characterization of MDS group codes over cyclic groups. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:2052-2056 [Journal]
  25. V. Shashidhar, B. Sundar Rajan, B. A. Sethuraman
    Information-Lossless Space-Time Block Codes From Crossed-Product Algebras. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:9, pp:3913-3935 [Journal]
  26. R. Vaze, B. Sundar Rajan
    On Space-Time Trellis Codes Achieving Optimal Diversity Multiplexing Tradeoff. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5060-5067 [Journal]
  27. Sanjay Karmakar, B. Sundar Rajan
    High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras. [Citation Graph (0, 0)][DBLP]
    GLOBECOM, 2006, pp:- [Conf]
  28. G. Susinder Rajan, Anshoo Tandon, B. Sundar Rajan
    On Four-group ML Decodable Distributed Space Time Codes for Cooperative Communication [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  29. G. Susinder Rajan, B. Sundar Rajan
    Distributed Space-Time Codes for Cooperative Networks with Partial CSI [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  30. G. Susinder Rajan, B. Sundar Rajan
    MMSE Optimal Algebraic Space-Time Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  31. Sanjay Karmakar, B. Sundar Rajan
    High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  32. G. Susinder Rajan, B. Sundar Rajan
    Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  33. G. Susinder Rajan, B. Sundar Rajan
    STBCs from Representation of Extended Clifford Algebras [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  34. G. Susinder Rajan, B. Sundar Rajan
    Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  35. G. Susinder Rajan, B. Sundar Rajan
    Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  36. G. Susinder Rajan, B. Sundar Rajan
    A Non-Orthogonal Distributed Space-Time Coded Protocol Part II-Code Construction and DM-G Tradeoff [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  37. G. Susinder Rajan, B. Sundar Rajan
    A Non-Orthogonal Distributed Space-Time Coded Protocol Part I: Signal Model and Design Criteria [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  38. Sanjay Karmakar, B. Sundar Rajan
    Multigroup-Decodable STBCs from Clifford Algebras [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  39. Priti Shankar, P. N. A. Kumar, K. Sasidharan, B. Sundar Rajan, A. S. Madhu
    Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  40. Md. Zafar Ali Khan, B. Sundar Rajan
    Single-Symbol Maximum Likelihood Decodable Linear STBCs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  41. G. Susinder Rajan, B. Sundar Rajan
    A Training based Distributed Non-Coherent Space-Time Coding Strategy [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  42. D. Sreedhar, A. Chockalingam, B. Sundar Rajan
    Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  43. J. Harshan, B. Sundar Rajan
    High Rate Single-Symbol Decodable Precoded DSTBCs for Cooperative Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  44. G. Susinder Rajan, B. Sundar Rajan
    Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  45. J. Harshan, B. Sundar Rajan
    High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  46. G. Susinder Rajan, B. Sundar Rajan
    Distributed Space Time Codes with Low Decoding Complexity for Asynchronous Relay Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  47. OFDM Based Distributed Space Time Coding for Asynchronous Relay Networks. [Citation Graph (, )][DBLP]


  48. Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks. [Citation Graph (, )][DBLP]


  49. Non-Differential DSTBCs for Partially-Coherent Cooperative Communication. [Citation Graph (, )][DBLP]


  50. Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks. [Citation Graph (, )][DBLP]


  51. Large MIMO Systems: A Low-Complexity Detector at High Spectral Efficiencies. [Citation Graph (, )][DBLP]


  52. A Low ML-Decoding Complexity, High Coding Gain, Full-Rate, Full-Diversity STBC for 4 × 2 MIMO System. [Citation Graph (, )][DBLP]


  53. A Training-Based Iterative Detection/Channel Estimation Scheme for Large Non-Orthogonal STBC MIMO Systems. [Citation Graph (, )][DBLP]


  54. A Low-Complexity Precoder for Large Multiuser MISO Systems. [Citation Graph (, )][DBLP]


  55. On the Maximal Rate of Non-Square STBCs from Complex Orthogonal Designs. [Citation Graph (, )][DBLP]


  56. Four Group Decodable Differential Scaled Unitary Linear Space-Time Codes. [Citation Graph (, )][DBLP]


  57. Low PAPR STBCs from Complex Partial-Orthogonal Designs (CPODs). [Citation Graph (, )][DBLP]


  58. Coordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks. [Citation Graph (, )][DBLP]


  59. High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance. [Citation Graph (, )][DBLP]


  60. A Low-Complexity, Full-Rate, Full-Diversity 2x2 STBC with Golden Code's Coding Gain. [Citation Graph (, )][DBLP]


  61. STBCs with Reduced Sphere Decoding Complexity for Two-User MIMO-MAC. [Citation Graph (, )][DBLP]


  62. Convolutional Codes for Network-Error Correction. [Citation Graph (, )][DBLP]


  63. Constellation Constrained Capacity of Two-User Broadcast Channels. [Citation Graph (, )][DBLP]


  64. Quasi-Orthogonal Design and Performance Analysis of Amplify-And-Forward Relay Networks with Multiple-Antennas. [Citation Graph (, )][DBLP]


  65. Low-complexity detection and performance in multi-gigabit high spectral efficiency wireless systems. [Citation Graph (, )][DBLP]


  66. A Matrix Characterization of Near - MDS codes. [Citation Graph (, )][DBLP]


  67. Maximum-rate, Minimum-Decoding-Complexity STBCs from Clifford Algebras [Citation Graph (, )][DBLP]


  68. Multi-group ML Decodable Collocated and Distributed Space Time Block Codes [Citation Graph (, )][DBLP]


  69. Large MIMO Detection: A Low-Complexity Detector at High Spectral Efficiencies [Citation Graph (, )][DBLP]


  70. OFDM based Distributed Space Time Coding for Asynchronous Relay Networks [Citation Graph (, )][DBLP]


  71. Leveraging Coherent Distributed Space-Time Codes for Noncoherent Communication in Relay Networks via Training [Citation Graph (, )][DBLP]


  72. Co-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks [Citation Graph (, )][DBLP]


  73. A Low-Complexity, Full-Rate, Full-Diversity 2 X 2 STBC with Golden Code's Coding Gain [Citation Graph (, )][DBLP]


  74. A Low-decoding-complexity, Large coding Gain, Full-rate, Full-diversity STBC for 4 X 2 MIMO System [Citation Graph (, )][DBLP]


  75. Asymptotic Analysis of the Performance of LAS Algorithm for Large MIMO Detection [Citation Graph (, )][DBLP]


  76. A Non-differential Distributed Space-Time Coding for Partially-Coherent Cooperative Communication [Citation Graph (, )][DBLP]


  77. Low-delay, Low-PAPR, High-rate Non-square Complex Orthogonal Designs [Citation Graph (, )][DBLP]


  78. Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity [Citation Graph (, )][DBLP]


  79. A Class of Maximal-Rate, Low-PAPR, Non-square Complex Orthogonal Designs [Citation Graph (, )][DBLP]


  80. Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 X 2 and 4 X 2 MIMO Systems [Citation Graph (, )][DBLP]


  81. High-Rate Space-Time Coded Large MIMO: Low-Complexity Detection and Channel Estimation [Citation Graph (, )][DBLP]


  82. Square Complex Orthogonal Designs with no Zero Entry for any 2m Antennas [Citation Graph (, )][DBLP]


  83. Coding for Two-User SISO and MIMO Multiple Access Channels [Citation Graph (, )][DBLP]


  84. Low-Complexity Near-ML Decoding of Large Non-Orthogonal STBCs using Reactive Tabu Search [Citation Graph (, )][DBLP]


  85. Belief Propagation Based Decoding of Large Non-Orthogonal STBCs [Citation Graph (, )][DBLP]


  86. Low-Complexity Near-ML Decoding of Large Non-Orthogonal STBCs Using PDA [Citation Graph (, )][DBLP]


  87. FRFD MIMO Systems: Precoded V-BLAST with Limited Feedback Versus Non-orthogonal STBC MIMO [Citation Graph (, )][DBLP]


  88. Convolutional Codes for Network-Error Correction [Citation Graph (, )][DBLP]


  89. Network error correction for unit-delay, memory-free networks using convolutional codes [Citation Graph (, )][DBLP]


  90. High-Rate, Distributed Training-Embedded Complex Orthogonal Designs for Relay Networks [Citation Graph (, )][DBLP]


  91. STBCs with Reduced Sphere Decoding Complexity for Two-User MIMO-MAC [Citation Graph (, )][DBLP]


  92. Trellis Coded Modulation for Two-User Unequal-Rate Gaussian MAC [Citation Graph (, )][DBLP]


  93. Training-Embedded, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks [Citation Graph (, )][DBLP]


  94. Single-generation Network Coding for Networks with Delay [Citation Graph (, )][DBLP]


  95. Near-ML Signal Detection in Large-Dimension Linear Vector Channels Using Reactive Tabu Search [Citation Graph (, )][DBLP]


  96. Orthogonal vs Non-Orthogonal Multiple Access with Finite Input Alphabet and Finite Bandwidth [Citation Graph (, )][DBLP]


  97. On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model [Citation Graph (, )][DBLP]


  98. Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems [Citation Graph (, )][DBLP]


  99. Fast-Group-Decodable STBCs via Codes over GF(4) [Citation Graph (, )][DBLP]


  100. A Hybrid RTS-BP Algorithm for Improved Detection of Large-MIMO M-QAM Signals [Citation Graph (, )][DBLP]


  101. A Practical Dirty Paper Coding Applicable for Broadcast Channel [Citation Graph (, )][DBLP]


  102. Asymptotically-Good, Multigroup ML-Decodable STBCs [Citation Graph (, )][DBLP]


  103. Reduced ML-Decoding Complexity, Full-Rate STBCs for $2^a$ Transmit Antenna Systems [Citation Graph (, )][DBLP]


  104. A New Full-diversity Criterion and Low-complexity STBCs with Partial Interference Cancellation Decoding [Citation Graph (, )][DBLP]


  105. A Quadratic Form Approach to ML Decoding Complexity of STBCs [Citation Graph (, )][DBLP]


  106. Low ML Decoding Complexity STBCs via Codes over GF(4) [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.606secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002