Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...
Traditionally, a transport protocol corrects errors in a computer communication network using a simple ARQ protocol. With the arrival of broadband networks, forward error correcti...
Abstract. We generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the prop...
Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redunda...
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...