In this paper, we present error-correcting codes that achieve the information-theoretically
best possible tradeoff between the rate and error-correction radius. Specifically, for every 0< …

We introduce a new family of error-correcting codes that have a polynomial-time encoder
and a polynomial-time list-decoder, correcting a fraction of adversarial errors up to/spl …

Interleaved Reed-Solomon codes are applied in numerous data processing, data
transmission, and data storage systems. They are generated by interleaving several …

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 …

We construct $ s $-interleaved linearized Reed--Solomon (ILRS) codes and variants and
propose efficient decoding schemes that can correct errors beyond the unique decoding …

Recently, Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory, 2019) showed that
lifted linearized Reed-Solomon codes are suitable codes for error control in multishot …

Wireless Sensor Networks (WSNs) are energy constraint networks that require reliable data
communication at a low cost of energy. Only one particular error correcting code (ECC) …

An h h-interleaved one-point Hermitian code is a direct sum of hh many one-point Hermitian
codes, where errors are assumed to occur at the same positions in the constituent …

This paper introduces the simultaneous partial-inverse problem (SPI) for polynomials and
develops its application to decoding interleaved Reed-Solomon codes beyond half the …

We show that punctured Reed-Solomon codes can be decoded virtually up to the Singleton
bound with computational complexity quadratic in the code length using our algorithm based …