#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2011

2014

- This year (0)
- Last five years (3)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Teja Damodaram Bavirisetti, Abhinav Ganesan, Krishnan Prasad, B. Sundar Rajan
- 2012 IEEE International Symposium on Information…
- 2012

The algebraic formulation for linear network coding in acyclic networks with each link having an integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes at any given time instant is a F<sub>q</sub>-linear… (More)

- Teja Damodaram Bavirisetti, B. Sundar Rajan
- 2011 IEEE International Symposium on Information…
- 2011

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 weight matrices is 2a over 2<sup>a</sup> complex symbols per channel use (cspcu) for 2<sup>a</sup> number of transmit antennas [1]. These STBCs are obtained from Unitary Weight… (More)

- Abhinav Ganesan, Teja Damodaram Bavirisetti, B. Sundar Rajan
- GLOBECOM
- 2012

—A transform approach to network coding was introduced by Bavirisetti et al. (arXiv:1103.3882v3 [cs.IT]) as a tool to view wireline networks with delays as k-instantaneous networks (for some large k). When the local encoding kernels (LEKs) of the network are varied with every time block of length k > 1, the network is said to use block time varying LEKs. In… (More)

- Teja Damodaram Bavirisetti, Abhinav Ganesan, Krishnan Prasad, B. Sundar Rajan
- IEEE Transactions on Information Theory
- 2014

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 over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F<sub>p</sub>m-linear… (More)

- Abhinav Ganesan, Teja Damodaram Bavirisetti, Krishnan Prasad, B. Sundar Rajan
- 2011 IEEE Information Theory Workshop
- 2011

The concept of interference alignment when extended to three-source three-destination instantaneous multiple unicast network for the case where, each source-destination pair has a min-cut of 1 and zero-interference conditions are not satisfied, is known to achieve a rate of half for every source-destination pair under certain conditions [6]. This was called… (More)

- ‹
- 1
- ›