activity
20022024
most citedMultiple Description Vector Quantization with Lattice Codebooks: Design and Analysis

209 citations · 340 across the 18 of their papers we have counts for

collaborators

22 papers

eess.SY2024

Effective Capacity of a Battery Energy Storage System Captive to a Wind Farm

Vinay A. Vaishampayan, Thilaharani Antony, Amirthagunaraj Yogarathnam

Wind energy's role in the global electric grid is set to expand significantly. New York State alone anticipates offshore wind farms (WFs) contributing 9GW by 2035. Integration of e…

cs.IT2020

On Communication for Distributed Babai Point Computation

Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa

We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector in a given lattic…

cs.IT2019

Classification in a Large Network

Vinay A. Vaishampayan

We construct and analyze the communication cost of protocols (interactive and one-way) for classifying , in a net…

cs.IT2018★ 1 cited

Communication-Efficient Search for an Approximate Closest Lattice Point

Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa

We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a net…

cs.IT2018

Lattice Erasure Codes of Low Rank with Noise Margins

Vinay A. Vaishampayan

We consider the following generalization of an MDS code for application to an erasure channel with additive noise. Like an MDS code, our code is required to be decodable fr…

cs.IT2018★ 1 cited

Interactive Nearest Lattice Point Search in a Distributed Setting: Two Dimensions

V. A. Vaishampayan, M. F. Bollauf

The nearest lattice point problem in is formulated in a distributed network with nodes. The objective is to minimize the probability that an incorrect lattice po…