- Distributed Space-Time Codes with Reduced Decoding Complexity
- DRDO--IISc Programme on Advanced Research in Mathematical
- 2062 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 5, MAY 2006 Single-Symbol Maximum Likelihood Decodable
- Single-Generation Network Coding for Networks Dept. of ECE, Indian Institute of Science
- This article was downloaded by:[Indian Institute of Science] On: 2 September 2007
- A General Construction of Space-Time Trellis Codes for PSK signal sets
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 9, SEPTEMBER 2006 3913 Information-Lossless SpaceTime Block Codes From
- Reduced ML-Decoding Complexity, Full-Rate STBCs for 2a
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 2, FEBRUARY 2002 537 However, for the lower bound on d in Corollary 2.6, we have
- Designs and Full-Rank STBCs from DFT Domain Description of Cyclic U. Sripati, V. Shashidhar and B. Sundar Rajan
- AAECC 13, 453474 (2003) DFT Domain Characterization of Quasi-Cyclic Codes
- Fast-Group-Decodable STBCs via Codes over GF(4) Lakshmi Prasad Natarajan and B. Sundar Rajan
- Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks
- DRDO--IISc Programme on Advanced Research in Mathematical Engineering
- Coding for Two-Antenna-Relays Networks Dept of ECE, Indian Institute of science
- 2406 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 8, AUGUST 2002 Quasi-Cyclic Dyadic Codes in the WalshHadamard
- Single Real-Symbol Decodable, High-Rate, Distributed Space-Time Block Codes
- High-rate STBC-MTCM Schemes for Quasi-static and Block-fading Channels
- IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 4, APRIL 2009 1783 Co-ordinate Interleaved Distributed Space-Time
- High-Rate, 2-Group ML-Decodable STBCs for 2m Transmit Antennas
- Training-Embedded, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks
- DRDO--IISc Programme on Advanced Research in Mathematical Engineering
- 4076 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 11, NOVEMBER 2008 A Non-differential Distributed Space-Time Coding for
- HIGH-RATE FULL-RANK SPACE-TIME BLOCK CODES FROM CAYLEY ALGEBRA Kiran. T and B. Sundar Rajan
- DRDO--IISc Programme on Advanced Research in Mathematical
- Full-diversity STBCs for Block-Fading channels from Cyclic codes
- On the Many Faces of Block Codes Kaustubh Deshmukh1
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 1, JANUARY 2009 223 Multigroup Decodable STBCs From
- Network Error Correction for Unit-Delay, Memory-Free Networks using Convolutional Codes
- 2682 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 6, JUNE 2009 High-Rate, Multisymbol-Decodable STBCs From
- A High-Rate Generalized Coded Delay Diversity Scheme and its Diversity-Multiplexing Tradeoff
- DRDO--IISc Programme on Advanced Research in Mathematical Engineering
- DRDO--IISc Programme on Advanced Research in Mathematical
- A Training-Based Iterative Detection/Channel Estimation Scheme for Large Non-Orthogonal STBC MIMO Systems
- Low PAPR STBCs from Complex Partial-Orthogonal Designs (CPODs)
- STBCs using Capacity Achieving Designs from CrossedProduct Division Algebras
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 4, APRIL 2004 691 Affine Invariant Extended Cyclic Codes Over Galois Rings
- A Low ML-Decoding Complexity, High Coding Gain, Full-Rate, Full-Diversity STBC for 4 2
- Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks
- On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model
- Low-Complexity Near-MAP Decoding of Large Non-Orthogonal STBCs Saif K. Mohammed, A. Chockalingam, and B. Sundar Rajan
- On the PAPR of Binary Reed-Muller OFDM Codes Kaustuvmani Manji
- Asymptotic-Information-Lossless Designs and Diversity-Multiplexing tradeoff
- Partially-Coherent Distributed Space-Time Codes with Differential Encoder and Decoder
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 3, MARCH 2011 1299 On Two-User Gaussian Multiple Access Channels
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 7, JULY 2010 3221 Multigroup ML Decodable Collocated and
- Distributed Space-Time Block Codes for Two-Hop Wireless Relay Networks
- 916 IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, VOL. 3, NO. 6, DECEMBER 2009 Low ML-Decoding Complexity, Large Coding Gain,
- 2672 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 5, MAY 2009 Single-Symbol ML Decodable Distributed STBCs
- 2004 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 5, MAY 2009 High-Rate, Single-Symbol ML Decodable Precoded
- IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 5, MAY 2009 2369 Low PAPR Square STBCs from
- IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 2, FEBRUARY 2009 683 Leveraging Coherent Distributed Space-Time Codes for
- 204 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 1, JANUARY 2009 Square Complex Orthogonal Designs with
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 1, JANUARY 2009 255 Asymptotic-Information-Lossless Designs and the
- IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 26, NO. 3, APRIL 2008 473 A Low-Complexity Detector for Large MIMO
- 2468 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 7, JULY 2008 MMSE Optimal Algebraic Space-Time Codes
- 426 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 25, NO. 2, FEBRUARY 2007 Partially-Coherent Distributed Space-Time
- Linear Algebra and its Applications 412 (2006) 396407 www.elsevier.com/locate/laa
- CODES CLOSED UNDER ARBITRARY ABELIAN GROUP OF PERMUTATIONS
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 2, FEBRUARY 2004 367 Consta-Abelian Codes Over Galois Rings
- 2596 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 10, OCTOBER 2003 Full-Diversity, High-Rate SpaceTime Block Codes
- 2242 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 9, SEPTEMBER 2003 Abelian Codes Over Galois Rings Closed Under Certain
- 684 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS--II: ANALOG AND DIGITAL SIGNAL PROCESSING, VOL. 48, NO. 7, JULY 2001 A Generalized Reverse Jacket Transform
- AAECC5,261-275 (1994) AAECCApplicableAlgebrain
- Fq-Linear Cyclic Codes over Fqm: DFT Characterization
- A Package for the Implementation of Block Codes as Finite Automata
- Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
- Asymptotically-Good, Multigroup ML-Decodable Lakshmi Prasad Natarajan and B. Sundar Rajan
- Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance
- Performance Analysis of Single-Symbol Maximum Likelihood Decodable Linear STBCs
- Improved Large-MIMO Detection Based on Damped Belief Propagation Pritam Som, Tanumay Datta, A. Chockalingam, and B. Sundar Rajan
- Quantum Error Correction via Codes over GF(2) Arijit Chowdhury
- A Novel Construction of Complex Orthogonal Designs with Maximal Rate and Low-PAPR
- Low-Complexity Near-ML Decoding of Large Non-Orthogonal STBCs using Reactive Tabu Search
- Belief Propagation Based Decoding of Large Non-Orthogonal STBCs Madhekar Suneel, Pritam Som, A. Chockalingam, and B. Sundar Rajan
- A Low-Complexity, Full-Rate, Full-Diversity 2 2 STBC with Golden Code's Coding Gain
- High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance
- Low-delay, High-rate, Non-square STBCs from Scaled Complex Orthogonal Designs
- Large MIMO Systems: A Low-Complexity Detector at High Spectral Efficiencies
- Non-Differential DSTBCs for Partially-Coherent Cooperative communication
- OFDM based Distributed Space Time Coding for Asynchronous Relay Networks
- On the Maximal Rate of Non-square STBCs from Complex Orthogonal Designs
- Four Group Decodable Differential Scaled Unitary Linear Space-Time Codes
- STBCs from Representation of Extended Clifford G. Susinder Rajan
- Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
- Square Complex Orthogonal Designs with Low Smarajit Das
- Complex Near-Orthogonal Designs with No Zero Gopu V R Muni Kumar
- On Four-group ML Decodable Distributed Space Time Codes for Cooperative Communication
- Distributed Space-Time Codes for Cooperative Networks with Partial CSI
- A Non-orthogonal Distributed Space-Time Coded Protocol
- A Non-orthogonal Distributed Space-Time Coded Protocol
- Multigroup-Decodable STBCs from Clifford Sanjay Karmakar and B. Sundar Rajan
- High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras
- Minimum-Decoding-Complexity, Maximum-rate Space-Time Block Codes from Clifford Algebras
- Non-Unitary-Weight Space-Time Block codes with Minimum Decoding Complexity
- On the Maximal Rate of (n + 1) n and (n + 2) n Complex Orthogonal Designs
- On Space-Time Trellis Codes Achieving Optimal Diversity Multiplexing Tradeoff
- A Systematic Design of High-rate Full-diversity Space-Frequency Codes for MIMO-OFDM Systems
- STBC-schemes with Non-vanishing Determinant for Certain Number of Transmit Antennas
- Full-Diversity Group Space-Time-Frequency (GSTF) codes from Cyclic codes
- Tradeoff between PAPR Reduction and Decoding Complexity in Transformed OFDM Systems
- Optimal STBCs from Codes over Galois Rings Kiran T. and B. Sundar Rajan
- Low-complexity, Full-diversity Space-Time-Frequency Block Codes for
- Information-Lossless STBCs from Crossed-Product Algebras V. Shashidhar and B. Sundar Rajan1
- STBCs with Optimal Diversity-Multiplexing Tradeoff for 2, 3 and 4 Transmit Antennas
- Consta-Dihedral Codes and their Transform Domain Characterization V. Shashidhar and B. Sundar Rajan
- Vandermonde-Cocyclic Codes and a suitable DFT Kiran .T and B. Sundar Rajan
- Matrix Characterization of Near-MDS Codes over Zm and Abelian Groups
- STBCs using Capacity Achieving Designs from Cyclic Division Algebras
- Rectangular Co-ordinate Interleaved Orthogonal Md. Zafar Ali Khan
- Optimal STBC over PSK Signal Sets from Cyclotomic Field Extensions B.A.Sethuraman
- MMSE Optimal Space-Time Block Codes from Crossed Product Algebras G. Susinder Rajan and B. Sundar Rajan
- High-rate Information-Lossless Linear Dispersion STBCs from Group Algebra
- Low Complexity Distributed STBCs with Unitary Relay Matrices for Any Number of Relays
- Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential
- Channel Precoding for STBCs from Generalized Pseudo Orthogonal Designs
- High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras Sanjay Karmakar
- 1620 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 4, JULY 1998 [7] Y. Kofman, E. Zehavi, and S. Shamai, "Performance analysis of a
- Designs, Codes and Cryptography, 13, 313330 (1998) c 1998 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems
- Finite Signal-set Capacity of Two-user Gaussian Multiple Access Channel
- Coding for Two-User Gaussian MAC with PSK and PAM Signal Sets
- On the Two-User SISO-Gaussian and MIMO-Fading MAC with Finite Input Alphabets
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 1, JANUARY 1999 365 [12] O. Sharon, "On the relation between bit delay for Slot Reuse and the
- 5060 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 11, NOVEMBER 2006 [33] S. Shamai (Shitz) and S. Verd, "The impact of frequency-flat fading
- On the Maximal Rate of Square Quasi-Orthogonal Designs Md. Zafar Ali Khan
- IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 49, NO. 1, JANUARY 2000 211 Performance of 4-and 8-State TCM Schemes with
- Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
- Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks
- A Rate-one Full-diversity Low-complexity Space-Time-Frequency Block Code (STFBC) for
- Theoretical Computer Science 290 (2003) 17751797 www.elsevier.com/locate/tcs
- 2984 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 8, AUGUST 2005 [8] N. R. Goodman, "Statistical analysis based on a certain multivariate
- 218 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 1, JANUARY 2004 A Generalization of Some Existence Results on Orthogonal
- Optimal Rate-Diversity Tradeoff STBCs from Codes over Arbitrary Finite Fields
- 3962 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 7, NO. 10, OCTOBER 2008 Algebraic Distributed Differential Space-Time
- DFT CHARACTERIZATION OF MINIMAL QUASICYCLIC Bikash Kumar Dey and B. Sundar Rajan
- DRDO--IISc Programme on Advanced Research in Mathematical Engineering
- DRDO--IISc Programme on Advanced Research in Mathematical
- Reviewed International Conference Papers: 153 Sl. Conference Number of
