A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Explicit Uniquely Decodable Codes for Space Bounded Channels That Achieve List-Decoding Capacity
[article]
2020
Electronic colloquium on computational complexity
We consider codes for space bounded channels. This is a model for communication under noise that was introduced by Guruswami and Smith (J. ACM 2016) and lies between the Shannon (random) and Hamming (adversarial) models. In this model, a channel is a space bounded procedure that reads the codeword in one pass, and modifies at most a p fraction of the bits of the codeword.
dblp:journals/eccc/ShaltielS20
fatcat:fpmrpw2rhzdl7gmvl5r6dxqi4a