54 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Indian Institute of Science BangaloreIN69 papers
- Indian Institute of Technology MadrasIN30 papers
- A. Alikhanyan National LaboratoryAM29 papers
- Abiola Ajimobi Technical University IbadanNG29 papers
- Adıyaman UniversityTR29 papers
- AGH University of KrakowPL29 papers
- Ain Shams UniversityEG29 papers
- At BristolGB29 papers
- Athens State UniversityUS29 papers
- Beihang UniversityCN29 papers
- Bethel CollegeUS29 papers
- Bethel UniversityUS29 papers
25 papers · 1 filter
Small-d MSR Codes with Optimal Access, Optimal Sub-Packetization and Linear Field Size
Myna Vajha, S. B. Balaji, P. Vijay Kumar
This paper presents an explicit construction of a class of optimal-access, minimum storage regenerating (MSR) codes, for small values of the number of helper nodes. The constru…
Polar Codes over Fading Channels with Power and Delay Constraints
P. K. Deekshith, K. R. Sahasranand
The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able t…
Decoding Network Codes using the Sum-Product Algorithm
Anindya Gupta, B. Sundar Rajan
While feasibility and obtaining a solution of a given network coding problem are well studied, the decoding procedure and complexity have not garnered much attention. We consider t…
On The Number of Optimal Linear Index Codes For Unicast Index Coding Problems
Kavitha R., Niranjana Ambadi, B. Sundar Rajan
An index coding problem arises when there is a single source with a number of messages and multiple receivers each wanting a subset of messages and knowing a different set of messa…
Vector Linear Error Correcting Index Codes and Discrete Polymatroids
Anoop Thomas, B. Sundar Rajan
The connection between index coding and matroid theory have been well studied in the recent past. El Rouayheb et al. established a connection between multi linear representation of…
Error Correcting Index Codes and Matroids
Anoop Thomas, B. Sundar Rajan
The connection between index coding and matroid theory have been well studied in the recent past. El Rouayheb et al. established a connection between multilinear representation of…
Space-Time Coded Spatial Modulated Physical Layer Network Coding for Two-Way Relaying
K. G. Unnikrishnan, B. Sundar Rajan
Using the spatial modulation approach, where only one transmit antenna is active at a time, we propose two transmission schemes for two-way relay channel using physical layer netwo…
Multiuser SM-MIMO versus Massive MIMO: Uplink Performance Comparison
P. Raviteja, T. Lakshmi Narasimhan, A. Chockalingam
In this paper, we propose algorithms for signal detection in large-scale multiuser {\em spatial modulation multiple-input multiple-output (SM-MIMO)} systems. In large-scale SM-MIMO…
Channel Hardening-Exploiting Message Passing (CHEMP) Receiver in Large-Scale MIMO Systems
T. Lakshmi Narasimhan, A. Chockalingam
In this paper, we propose a MIMO receiver algorithm that exploits {\em channel hardening} that occurs in large MIMO channels. Channel hardening refers to the phenomenon where the o…
Performance Analysis of Adaptive Physical Layer Network Coding for Wireless Two-way Relaying
Vijayvaradharaj T. Muralidharan, B. Sundar Rajan
The analysis of modulation schemes for the physical layer network-coded two way relaying scenario is presented which employs two phases: Multiple access (MA) phase and Broadcast (B…
An Adaptive Modulation Scheme for Two-user Fading MAC with Quantized Fade State Feedback
Sudipta Kundu, B. Sundar Rajan
With no CSI at the users, transmission over the two-user Gaussian Multiple Access Channel with fading and finite constellation at the input, is not efficient because error rates wi…
A Matroidal Framework for Network-Error Correcting Codes
K. Prasad, B. Sundar Rajan
We abstract the essential aspects of network-error detecting and correcting codes to arrive at the definitions of matroidal error detecting networks and matroidal error correcting…
Wireless Network Coding for MIMO Two-way Relaying using Latin Rectangles
Vijayvaradharaj T. Muralidharan, B. Sundar Rajan
The design of modulation schemes for the physical layer network-coded two-way MIMO relaying scenario is considered, with antennas at the relay R, and antennas res…
Wireless Bidirectional Relaying and Latin Squares
Vishnu Namboodiri, Vijayvaradharaj T. Muralidharan, B. Sundar Rajan
The design of modulation schemes for the physical layer network-coded two way relaying scenario is considered with the protocol which employs two phases: Multiple access (MA) Phase…
Channel Quantization for Physical Layer Network-Coded Two-Way Relaying
Vijayvaradharaj T Muralidharan, Vishnu Namboodiri, B. Sundar Rajan
The design of modulation schemes for the physical layer network-coded two way relaying scenario is considered with the protocol which employs two phases: Multiple access (MA) Phase…
Maximum Rate of 3- and 4-Real-Symbol ML Decodable Unitary Weight STBCs
Teja Damodaram Bavirisetti, B. Sundar Rajan
It has been shown recently that the maximum rate of a 2-real-symbol (single-complex-symbol) maximum likelihood (ML) decodable, square space-time block codes (STBCs) with unitary we…
On the Sphere Decoding Complexity of STBCs for Asymmetric MIMO Systems
Lakshmi Prasad Natarajan, K. Pavan Srinath, B. Sundar Rajan
In the landmark paper by Hassibi and Hochwald, it is claimed without proof that the upper triangular matrix R encountered during the sphere decoding of any linear dispersion code i…
A Transform Approach to Linear Network Coding for Acyclic Networks with Delay
Teja Damodaram Bavirisetti, G. Abhinav, K. Prasad +1
The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections…
On network coding for acyclic networks with delays
K. Prasad, B. Sundar Rajan
Problems related to network coding for acyclic, instantaneous networks (where the edges of the acyclic graph representing the network are assumed to have zero-delay) have been exte…
Network-Error Correcting Codes using Small Fields
K. Prasad, B. Sundar Rajan
Existing construction algorithms of block network-error correcting codes require a rather large field size, which grows with the size of the network and the number of sinks, and th…
Distributed STBCs with Full-diversity Partial Interference Cancellation Decoding
Lakshmi Prasad Natarajan, B. Sundar Rajan
Recently, Guo and Xia introduced low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include t…
A New Full-diversity Criterion and Low-complexity STBCs with Partial Interference Cancellation Decoding
Lakshmi Prasad Natarajan, B. Sundar Rajan
Recently, Guo and Xia gave sufficient conditions for an STBC to achieve full diversity when a PIC (Partial Interference Cancellation) or a PIC-SIC (PIC with Successive Interference…
Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs
Lakshmi Prasad Natarajan, B. Sundar Rajan
For a family/sequence of STBCs , with increasing number of transmit antennas , with rates complex symbols per channel use (cspcu), the…
Fast-Group-Decodable STBCs via Codes over GF(4)
N. Lakshmi Prasad, B. Sundar Rajan
In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown…