1 citations · 1 across the 4 of their papers we have counts for
Showing 2022 · cs.ITShow all
3 papers · 2 filters
cs.IT2022
Upper bounds on the Rate of Uniformly-Random Codes for the Deletion Channel
Berivan Isik, Francisco Pernice, Tsachy Weissman
We consider the maximum coding rate achievable by uniformly-random codes for the deletion channel. We prove an upper bound that's within 0.1 of the best known lower bounds for all…
cs.IT2022★ 1 cited
Efficient Near-Optimal Codes for General Repeat Channels
Francisco Pernice, Ray Li, Mary Wootters
Given a probability distribution over the non-negative integers, a -repeat channel acts on an input symbol by repeating it a number of times distributed…
cs.IT2022
On the Symmetries of the Deletion Channel
Francisco Pernice
In this paper, we consider a class of symmetry groups associated to communication channels, which can informally be viewed as the transformations of the set of inputs that ``commut…