activity
20102025
most citedLow ML Decoding Complexity STBCs via Codes over GF(4)

2 citations · 5 across the 6 of their papers we have counts for

collaborators

6 papers

cs.IT2025

BiD Codes: Algebraic Codes from Kernel

Anirudh Dash, K. R. Nandakishore, Lakshmi Prasad Natarajan +1

We introduce Berman-intersection-dual Berman (BiD) codes. These are abelian codes of length that can be constructed using Kronecker products of a kernel matrix.…

cs.IT2025

Subcodes of Second-Order Reed-Muller Codes via Recursive Subproducts

A P Vaideeswaran, Madireddi Sai Harish, Lakshmi Prasad Natarajan

We use a simple construction called `recursive subproducts' (that is known to yield good codes of lengths , ) to identify a family of codes sandwiched between first-…

cs.IT2018

On Locally Decodable Index Codes

Lakshmi Natarajan, Prasad Krishnan, V. Lalitha

Index coding achieves bandwidth savings by jointly encoding the messages demanded by all the clients in a broadcast channel. The encoding is performed in such a way that each clien…

cs.IT2015★ 1 cited

Capacity of Coded Index Modulation

Lakshmi Natarajan, Yi Hong, Emanuele Viterbo

We consider the special case of index coding over the Gaussian broadcast channel where each receiver has prior knowledge of a subset of messages at the transmitter and demands all…

cs.IT2010★ 2 cited

Low ML Decoding Complexity STBCs via Codes over GF(4)

Lakshmi Prasad Natarajan, B. Sundar Rajan

In this paper, we give a new framework for constructing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field . Almost all known…

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…