activity
20072026
most citedCo-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks

26 citations · 103 across the 41 of their papers we have counts for

collaborators
Showing cs.ITShow all

42 papers · 1 filter

cs.IT2026

Multiple-Function Approximated Coded Computing: Constructions and Error Bounds

Rimpi Borah, Wilton Kim, J. Harshan +2

Coded computing mitigates stragglers in distributed computation. While Lagrange coded computing (LCC) enables exact polynomial computation over finite fields, Berrut approximated c…

cs.IT2026

Robust Berrut-Approximated Coded Computing via Discrete Cosine Transforms

Rimpi Borah, J. Harshan

Coded computing is a reliable and fault-tolerant paradigm for executing large-scale computational tasks over distributed worker nodes. Among existing coded computing frameworks, Be…

cs.IT2026

Cooperative Mitigation against Learning-Based Reactive Jammers: Analysis and SDR Validation

Soumita Hazra, J. Harshan

Motivated by recent developments in full-duplex radios, cognitive radios, and data-driven signal-processing, we propose a novel class of reactive jamming adversaries wherein the ad…

cs.IT2026

Balancing Privacy and Robustness in Coded Computing Under Profiled Workers

Rimpi Borah, J. Harshan, Aaditya Sharma

In distributed computing with untrusted workers, the assignment of evaluation indices plays a critical role in determining both privacy and robustness. In this work, we study how t…

cs.IT2026

Basis-Spline Assisted Coded Computing: Strategies and Error Bounds

Rimpi Borah, J. Harshan, V. Lalitha

Coded computing has emerged as a key framework for addressing the impact of stragglers in distributed computation. While polynomial functions often admit exact recovery under exist…

cs.IT2025

Robust Analog Lagrange Coded Computing: Theory and Algorithms via Discrete Fourier Transforms

Rimpi Borah, J. Harshan

Analog Lagrange Coded Computing (ALCC) is a recently proposed computational paradigm wherein certain computations over analog datasets are efficiently performed using distributed w…

cs.IT2025

On Securing Berrut Approximated Coded Computing Through Discrete Cosine Transforms

Rimpi Borah, J. Harshan

Coded computing is a reliable and fault-tolerant mechanism for implementing large computing tasks over a distributed set of worker nodes. While a majority of coded computing framew…

cs.IT2025

Network-Centric Countermeasures Against Integrated Sensing Enabled Jamming Adversaries

Soumita Hazra, J. Harshan

Recent developments in Integrated Sensing and Communication have led to new adversarial models in wireless security through Integrated Sensing and Jamming (ISAJ) adversaries. ISAJ…

cs.IT2025

Helper-Friendly Latency-Bounded Mitigation Strategies against Reactive Jamming Adversaries

Soumita Hazra, J. Harshan

Due to the recent developments in the field of full-duplex radios and cognitive radios, a new class of reactive jamming attacks has gained attention wherein an adversary transmits…

cs.IT2024

On Securing Analog Lagrange Coded Computing from Colluding Adversaries

Rimpi Borah, J. Harshan

Analog Lagrange Coded Computing (ALCC) is a recently proposed coded computing paradigm wherein certain computations over analog datasets can be efficiently performed using distribu…

cs.IT2024

On Learning Spatial Provenance in Privacy-Constrained Wireless Networks

Manish Bansal, Pramsu Srivastava, J. Harshan

In Vehicle-to-Everything networks that involve multi-hop communication, the Road Side Units (RSUs) typically aim to collect location information from the participating vehicles to…

cs.IT2023

Self-Sustainable Key Generation: Strategies and Performance Bounds under DoS Attacks

Rusni Kima Mangang, J. Harshan

Denial-of-Service (DoS) threats pose a major challenge to the idea of physical-layer key generation as the underlying wireless channels for key extraction are usually public. Ident…

cs.IT2023

On Distribution-Preserving Mitigation Strategies for Communication under Cognitive Adversaries

Soumita Hazra, J. Harshan

In wireless security, cognitive adversaries are known to inject jamming energy on the victim's frequency band and monitor the same band for countermeasures thereby trapping the vic…

cs.IT2022

One-Hop Listening Based ARQs for Low-Latency Communication in Multi-Hop Networks

Jaya Goel, J. Harshan

Inspired by emerging applications in vehicular networks, we address the problem of achieving high-reliability and low-latency communication in multi-hop wireless networks. We propo…

cs.IT2022

Hybrid-ARQ Based Relaying Strategies for Enhancing Reliability in Delay-Bounded Networks

Jaya Goel, J. Harshan

Inspired by several delay-bounded mission-critical applications, this paper investigates chase-combining-based hybrid automatic repeat request (CC-HARQ) protocols to achieve high r…

cs.IT2022

Optimization of ARQ Distribution for HARQ Strategies in Delay-Bounded Networks

Jaya Goel, J. Harshan

Inspired by several delay-bounded mission-critical applications, optimizing the end-to-end reliability of multi-hop networks is an important problem subject to end-to-end delay con…

cs.IT2021★ 3 cited

XOR-Based Codes for Private Information Retrieval with Private Side Information

Murali Krishnan K. H., J. Harshan

We consider the problem of Private Information Retrieval with Private Side Information (PIR-PSI), wherein a user wants to retrieve a file from replication based non-colluding datab…

cs.IT2021

Path-Aware OMP Algorithms for Provenance Recovery in Wireless Networks

Shilpi Mishra, J. Harshan, Ranjitha Prasad

Low-latency provenance embedding methods have received traction in vehicular networks for their ability to track the footprint of information flow. One such known method is based o…

cs.IT2021

Minimal Overhead ARQ Sharing Strategies for URLLC in Multi-Hop Networks

Jaya Goel, J. Harshan

The problem of achieving ultra-reliable and low-latency communication (URLLC) in multi-terminal networks has gained traction in the recent past owing to new wireless applications i…

cs.IT2021

On Opportunistic Selection of Common Randomness and LLR generation for Algebraic Group Secret-Key Generation

Rohit Joshi, J. Harshan

It is well known that physical-layer key generation methods enable wireless devices to harvest symmetric keys by accessing the randomness offered by the wireless channels. Although…

cs.IT2020★ 1 cited

Fast-Forward Relaying Scheme to Mitigate Jamming Attacks by Full-Duplex Radios

Vivek Chaudhary, J. Harshan

In this work, we address reliable communication of low-latency packets in the presence of a full-duplex adversary that is capable of executing a jamming attack while also being abl…

cs.IT2019

Achievable Rates of Attack Detection Strategies in Echo-Assisted Communication

Mohit Goyal, J. Harshan

We consider an echo-assisted communication model wherein block-coded messages, when transmitted across several frames, reach the destination as multiple noisy copies. We address ad…

cs.IT2018★ 1 cited

Cognitive Radio from Hell: Flipping Attack on Direct-Sequence Spread Spectrum

J. Harshan, Yih-Chun Hu

In this paper, we introduce a strong adversarial attack, referred to as the flipping attack, on Direct-Sequence Spread Spectrum (DSSS) systems. In this attack, the attacker, which…

cs.IT2017★ 1 cited

Insider-Attacks on Physical-Layer Group Secret-Key Generation in Wireless Networks

J. Harshan, Sang-Yoon Chang, Yih-Chun Hu

Physical-layer group secret-key (GSK) generation is an effective way of generating secret keys in wireless networks, wherein the nodes exploit inherent randomness in the wireless c…