activity
20172024
most citedExplicit optimal-length locally repairable codes of distance 5

17 citations · 22 across the 8 of their papers we have counts for

collaborators

9 papers

cs.LG2024

VALID: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence

Mayank Bakshi, Sara Ghasvarianjahromi, Yauhen Yakimenka +3

We introduce the paradigm of validated decentralized learning for undirected networks with heterogeneous data and possible adversarial infiltration. We require (a) convergence to a…

cs.IT2022

Network Decoding

Allison Beemer, Altan Berdan Kilic, Alberto Ravagnani

We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model t…

cs.IT2021★ 2 cited

RELDEC: Reinforcement Learning-Based Decoding of Moderate Length LDPC Codes

Salman Habib, Allison Beemer, Joerg Kliewer

In this work we propose RELDEC, a novel approach for sequential decoding of moderate length low-density parity-check (LDPC) codes. The main idea behind RELDEC is that an optimized…

cs.IT2021

Keyless Authentication for AWGN Channels

Eric Graves, Allison Beemer, Jorg Kliewer +2

This work establishes that the physical layer can be used to perform information-theoretic authentication in additive white Gaussian noise channels, as long as the adversary is not…

cs.IT2021★ 2 cited

The Curious Case of the Diamond Network

Allison Beemer, Alberto Ravagnani

This work considers the one-shot capacity of communication networks subject to adversarial noise affecting a subset of network edges. In particular, we examine previously-establish…

cs.IT2020★ 1 cited

Learning to Decode: Reinforcement Learning for Decoding of Sparse Graph-Based Channel Codes

Salman Habib, Allison Beemer, Joerg Kliewer

We show in this work that reinforcement learning can be successfully applied to decoding short to moderate length sparse graph-based channel codes. Specifically, we focus on low-de…