output
20082026
most citedTen Years of Generative Adversarial Nets (GANs): A survey of the state-of-the-art

168 citations

Showing cs.ITShow all

18 papers · 1 filter

cs.IT2018★ 3 cited

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…

cs.IT2015

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…

cs.IT2015★ 4 cited

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…

cs.IT2015★ 2 cited

Performance Analysis of Split Preamble RAN Over-load Protocol for M2M Communications in Cellular Networks

A. Pourmoghadas, P. G. Poonacha

Machine type communications (MTC) in 3G/4G networks is getting more attention recently due to bursty nature of traffic characteristics in contrast to Poisson type H2H traffic. A la…

cs.IT2014

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…

cs.IT2012

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…

cs.IT2012★ 1 cited

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…

cs.IT2012★ 2 cited

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…

cs.IT2011★ 9 cited

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…

cs.IT2011★ 6 cited

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…

cs.IT2011★ 1 cited

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…

cs.IT2011★ 5 cited

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…

cs.IT2011★ 3 cited

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…

cs.IT2010

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…

cs.IT2010★ 1 cited

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…

cs.IT2010★ 1 cited

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…

cs.IT2010★ 2 cited

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…

cs.IT2010

On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model

K. Prasad, B. Sundar Rajan

Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm…