Results 11 to 20 of about 868,467 (209)
Twisted reed-solomon codes [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 In this article, we present a new construction of evaluation codes in the Hamming metric, which we call twisted Reed-Solomon codes. Whereas Reed-Solomon (RS) codes are MDS codes, this need not be the case for twisted RS codes. Nonetheless, we show that our construction yields several families of MDS codes. Further, for a large subclass of (MDS) twisted
Peter Beelen +2 more
core +10 more sources
Lifted projective Reed–Solomon codes [PDF]
Designs, Codes and Cryptography, 2018 Lifted Reed-Solomon codes, introduced by Guo, Kopparty and Sudan in 2013, are known as one of the few families of high-rate locally correctable codes. They are built through the evaluation over the affine space of multivariate polynomials whose restriction along any affine line can be interpolated as a low degree univariate polynomial.
Lavauzelle, Julien, Julien Lavauzelle
openaire +8 more sources
CoRR, 2018 We introduce Reed-Solomon-Gabidulin codes which is, at the same time, an extension to Reed-Solomon codes on the one hand and Gabidulin codes on the other hand. We prove that our codes have good properties with respect to the minimal distance and design an efficient decoding algorithm.
Caruso, Xavier, Durand, Amaury
openaire +4 more sources
Duals of linearized Reed–Solomon codes
Designs, Codes and Cryptography, 2022 We give a description of the duals of linearized Reed-Solomon codes in terms of codes obtained by taking residues of Ore rational functions. Our construction shows in particular that, under some assumptions on the base field, the class of linearized Reed-Solomon codes is stable under duality.
Caruso, Xavier, Durand, Amaury
core +8 more sources
Reed-Solomon convolutional codes
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005 In this paper we will introduce a specific class of cyclic convolutional codes. The construction is based on Reed-Solomon block codes. The algebraic parameters as well as the distance of these codes are determined. This shows that some of these codes are optimal or near optimal.
Gluesing-Luerssen, H, Schmale, W
core +4 more sources
The automorphism groups of Reed-Solomon codes
Journal of Combinatorial Theory, Series A, 1987 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dür, Arne
openaire +3 more sources
The automorphisms and error orbits of Reed – Solomon codes
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2020 The purpose of this work with its results presented in the article was to develop and transfer to the class of Reed – Solomon codes (RS-codes) the basic provisions of the theory of syndrome norms (TNS), previously developed for the noise-resistant coding
S. I. Semyonov, V. A. Lipnitsky
doaj +2 more sources
Reliability on QR codes and Reed-Solomon codes [PDF]
CoRRThis study addresses the use of Reed-Solomon error correction codes in QR codes to enhance resilience against failures. To fully grasp this approach, a basic cryptographic context is provided, necessary for understanding Reed-Solomon codes. The study begins by defining a code and explores key outcomes for codes with additional properties, such as ...
Bajaj, Bhavuk Sikka
core +5 more sources
U ovom radu opisani su osnovni matematički postupci vezani za Reed-Solomonove kodove s naglaskom na kodove definirane nad proširenjem polja GF(2). Opisani su postupci aritmetike konačnog polja nad elementima polja te nad polinomima definiranim nad istim ...
Hermann Kautschitsch, Gert Kadunz
core +5 more sources
Repairing Reed-solomon codes [PDF]
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016 We study the performance of Reed-Solomon (RS) codes for the \em exact repair problem \em in distributed storage. Our main result is that, in some parameter regimes, Reed-Solomon codes are optimal regenerating codes, among MDS codes with linear repair schemes.
Venkatesan Guruswami, Mary Wootters
openaire +4 more sources