Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Beemer, Allison"'
In this paper we study $\gamma$ partial correction over a $t$-user arbitrarily varying multiple-access channel (AV-MAC). We first present necessary channel conditions for the $\gamma$ partially correcting authentication capacity region to have nonemp
Externí odkaz:
http://arxiv.org/abs/2407.17582
Autor:
Bakshi, Mayank, Ghasvarianjahromi, Sara, Yakimenka, Yauhen, Beemer, Allison, Kosut, Oliver, Kliewer, Joerg
We introduce the paradigm of validated decentralized learning for undirected networks with heterogeneous data and possible adversarial infiltration. We require (a) convergence to a global empirical loss minimizer when adversaries are absent, and (b)
Externí odkaz:
http://arxiv.org/abs/2405.07316
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 this problem via an adversarial noise, presenting a formal framework an
Externí odkaz:
http://arxiv.org/abs/2205.14655
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 decoding policy is subsequently obtained via reinforcement learning ba
Externí odkaz:
http://arxiv.org/abs/2112.13934
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 omniscient. The model considered consists of an encoder, decoder, and
Externí odkaz:
http://arxiv.org/abs/2111.06386
Autor:
Beemer, Allison, Ravagnani, Alberto
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-established upper bounds on one-shot capacity. We introduce the Diamond Network
Externí odkaz:
http://arxiv.org/abs/2107.02144
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-density parity check (LDPC) codes, which for example have been standardi
Externí odkaz:
http://arxiv.org/abs/2010.05637
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 the transmission and may use this knowledge to choose the channel stat
Externí odkaz:
http://arxiv.org/abs/2001.03593
Autor:
Graves, Eric, Beemer, Allison
We construct a modular scheme which extends codes for wiretap channels of type I for use in wiretap channels of type II. This is done by using a concatenate and permute strategy, wherein multiple uses of the wiretap type I code are concatenated and t
Externí odkaz:
http://arxiv.org/abs/1901.06377
Publikováno v:
Proceedings of the 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 800-804 (2018). IEEE
Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs offer the ideal trade-off between minimum distance and locality, a measure of the cost of
Externí odkaz:
http://arxiv.org/abs/1810.03980