20 citations · 29 across the 15 of their papers we have counts for
16 papers
A Joint Power-Privacy Control Framework for Decentralized Learning over Heterogeneous Wireless Multicasting Networks
Amir Ziaeddini, Yauhen Yakimenka, Joerg Kliewer
In this paper, we propose a decentralized learning framework that incorporates both power control and privacy guarantees. Specifically, we enable a set of clients in a wireless mul…
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…
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…
Nested Array-Based Spatially Coupled LDPC Codes
Salman Habib, David G. M. Mitchell, Joerg Kliewer
Linear nested codes, where two or more sub-codes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider…
Information Leakage in Zero-Error Source Coding: A Graph-Theoretic Perspective
Yucheng Liu, Lawrence Ong, Sarah Johnson +3
We study the information leakage to a guessing adversary in zero-error source coding. The source coding problem is defined by a confusion graph capturing the distinguishability bet…
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…
Authentication Against a Myopic Adversary
Mayank Bakshi, Allison Beemer, Eric Graves +3
We consider keyless authentication for point-to-point communication in the presence of a myopic adversary. In particular, the adversary has access to a non-causal noisy version of…
Secure Distributed Storage: Rate-Privacy Trade-Off and XOR-Based Coding Scheme
Remi A. Chou, Joerg Kliewer
We consider the problem of storing data in a distributed manner over servers. We require the data (i) to be recoverable from the servers, and (ii) to remain private from an…
Private and Secure Distributed Matrix Multiplication with Flexible Communication Load
Malihe Aliasgari, Osvaldo Simeone, Joerg Kliewer
Large matrix multiplications are central to large-scale machine learning applications. These operations are often carried out on a distributed computing platform with a master serv…
Single-Source/Sink Network Error Correction Is as Hard as Multiple-Unicast
Wentao Huang, Tracey Ho, Michael Langberg +1
We study the problem of communicating over a single-source single-terminal network in the presence of an adversary that may jam a single link of the network. If any one of the edge…
Reverse Edge Cut-Set Bounds for Secure Network Coding
Wentao Huang, Tracey Ho, Michael Langberg +1
We consider the problem of secure communication over a network in the presence of wiretappers. We give a new cut-set bound on secrecy capacity which takes into account the contribu…
On secure network coding with uniform wiretap sets
Wentao Huang, Tracey Ho, Michael Langberg +1
This paper shows determining the secrecy capacity of a unicast network with uniform wiretap sets is at least as difficult as the k-unicast problem. In particular, we show that a ge…
An Algebraic Framework for Concatenated Linear Block Codes in Side Information Based Problems
Felipe Cinelli Barbosa, Joerg Kliewer, Max H. M. Costa
This work provides an algebraic framework for source coding with decoder side information and its dual problem, channel coding with encoder side information, showing that nested co…
On Secure Communication with Constrained Randomization
Matthieu R. Bloch, Joerg Kliewer
In this paper, we investigate how constraints on the randomization in the encoding process affect the secrecy rates achievable over wiretap channels. In particular, we characterize…
Multiple-access Network Information-flow and Correction Codes
Theodoros K. Dikaliotis, Tracey Ho, Sidharth Jaggi +5
This work considers the multiple-access multicast error-correction scenario over a packetized network with malicious edge adversaries. The network has min-cut and packets o…
Multiple Access Network Information-flow And Correction codes
Hongyi Yao, Theodoros K. Dikaliotis, Sidharth Jaggi +1
The network communication scenario where one or more receivers request all the information transmitted by different sources is considered. We introduce distributed polynomial-time…