Results 11 to 20 of about 33,515 (176)

Twisted Reed-Solomon Codes [PDF]

2017 IEEE International Symposium on Information Theory (ISIT), 2017
We present a new general construction of MDS codes over a finite field $\mathbb{F}_q$. We describe two explicit subclasses which contain new MDS codes of length at least $q/2$ for all values of $q \ge 11$. Moreover, we show that most of the new codes are
Beelen, Peter, Nielsen, Johan Rosenkilde né, Puchinger, Sven   +2 more
core   +9 more sources

Quantum Reed-Solomon Codes [PDF]

, 1999
After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about the position of
A. Barenco, A. Berthiaume, A. R. Calderbank, A. R. Calderbank, A. Steane, D. G. Cory, D. Jungnickel, J. I. Cirac, M. Grassl, P. M. A. Dirac, T. Beth, —, —, —   +13 more
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 ...
Guruswami, Venkatesan, Wootters, Mary
core   +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

Major Causes of Perinatal and Paediatric Mortality in Sub-Saharan Africa and South Asia: Adjustment for Selection Bias in the CHAMPS Network. [PDF]

Paediatr Perinat Epidemiol
ABSTRACT Background Studies of child mortality that employ minimally invasive tissue sampling (MITS) produce highly accurate cause of death data; however, selection bias may render these as non‐representative of their underlying populations. Objectives Estimate cause‐specific mortality fractions and rates for the five most frequent causes—underlying ...
Vyas KJ, Muir JA, Madewell ZJ, Gupta PM, Blau DM, Arifeen SE, Gurley ES, Chowdhury AI, Islam KM, Rahman A, Scott JAG, Assefa N, Madrid L, Asefa YA, Abdullahi YY, Onyango D, Akelo V, Tippett-Barr BA, Aol G, Sow SO, Kotloff KL, Tapia MD, Keita AM, Chawla K, Bassat Q, Mandomando I, Nhacolo A, Sacoor C, Ogbuanu I, Kowuor D, Duduyemi B, Moseray A, Squire JS, Madhi S, Mahtab S, Adam Y, Wise A, Machemedza T, Whitney CG, CHAMPS Network.   +39 more
europepmc   +2 more sources

Balanced Reed-Solomon codes [PDF]

2016 IEEE International Symposium on Information Theory (ISIT), 2016
We consider the problem of constructing linear Maximum Distance Separable (MDS) error-correcting codes with generator matrices that are sparsest and balanced. In this context, sparsest means that every row has the least possible number of non-zero entries, and balanced means that every column contains the same number of non-zero entries.
Halbawi, Wael, Liu, Zihan, Hassibi, Babak   +2 more
openaire   +3 more sources

Decoding Reed–Solomon Skew-Differential Codes [PDF]

IEEE Transactions on Information Theory, 2021
A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making them fully accesible for everyone.
Jose Gomez-Torrecillas, Gabriel Navarro, Jose Patricio Sanchez-Hernandez   +2 more
openaire   +5 more sources

Weighted Reed–Solomon convolutional codes

Linear and Multilinear Algebra, 2023
In this paper we present a concrete algebraic construction of a novel class of convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be seen as a natural extension of Reed-Solomon block codes to the context of convolutional codes.
Alfarano, Gianira N., Napp, Diego, Neri, Alessandro, Requena, Verónica   +3 more
openaire   +4 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. In this work, we
openaire   +5 more sources

Lifted Multiplicity Codes and the Disjoint Repair Group Property [PDF]

, 2019
Lifted Reed Solomon Codes (Guo, Kopparty, Sudan 2013) were introduced in the context of locally correctable and testable codes. They are multivariate polynomials whose restriction to any line is a codeword of a Reed-Solomon code.
Li, Ray, Wootters, Mary
core   +2 more sources