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

168 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2010Show all

8 papers · 1 filter

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.DB2010

Providing Scalable Data Services in Ubiquitous Networks

Tanu Malik, Raghvendra Prasad, Sanket Patil +2

Topology is a fundamental part of a network that governs connectivity between nodes, the amount of data flow and the efficiency of data flow between nodes. In traditional networks,…

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.NI2010★ 4 cited

An Efficient Hidden Markov Model for Offline Handwritten Numeral Recognition

B. S. Saritha, S. Hemanth

Traditionally, the performance of ocr algorithms and systems is based on the recognition of isolated characters. When a system classifies an individual character, its output is typ…

hep-ph2010

Total Cross-sections at very high energies: from protons to photons

R. M. Godbole, A. Grau, G. Pancheri +1

A model for both proton and photon total cross-sections is presented and compared with data. The model is based on the eikonal representation, with QCD mini-jets to drive the rise…

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…