1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
Francisco Pernice, Oscar Sprumont, Mary Wootters
It is known that the Shannon capacity of the q-ary symmetric channel (qSC) is the same as the list-decoding capacity of an adversarial channel, raising the question of whether ther…
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…
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…
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…