10 citations · 30 across the 11 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2018★ 1 cited
A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics
Arash Atashpendar, David Mestel, A. W. Roscoe +1
From the output produced by a memoryless deletion channel from a uniformly random input of known length , one obtains a posterior distribution on the channel input. The differen…
cs.IT2018★ 9 cited
From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions
Arash Atashpendar, Marc Beunardeau, Aisling Connolly +4
A binary string transmitted via a memoryless i.i.d. deletion channel is received as a subsequence of the original input. From this, one obtains a posterior distribution on the chan…