Results 1 to 10 of about 5,913 (208)
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 +8 more sources
Low-Complexity Chase Decoding of Reed–Solomon Codes Using Channel Evaluation [PDF]
Entropy, 2022 A novel time-varying channel adaptive low-complexity chase (LCC) algorithm with low redundancy is proposed, where only the necessary number of test vectors (TVs) are generated and key equations are calculated according to the channel evaluation to reduce
Hao Wang +4 more
doaj +2 more sources
Entanglement-Assisted Quantum Codes from Cyclic Codes [PDF]
Entropy, 2022 Entanglement-assisted quantum-error-correcting (EAQEC) codes are quantum codes which use entanglement as a resource. These codes can provide better error correction than the (entanglement unassisted) codes derived from the traditional stabilizer ...
Francisco Revson F. Pereira +1 more
doaj +2 more sources
Some new QEC MDS codes with large minimum distance [PDF]
Scientific ReportsThe advancement of Quantum Error-Correcting (QEC) Maximum Distance Separable (MDS) codes holds substantial importance in practical applications, substantially augmenting the reliability and efficiency of quantum communication and computing.
Lanqiang Li +3 more
doaj +2 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
Symbol-level iterative information set decoding of RS codes
Alexandria Engineering Journal, 2023 This paper presents the implementation of a low-complex iterative symbol-level decoding scheme for Reed-Solomon codes. Most soft-decision iterative decoders for Reed-Solomon codes work on a bit level due to the efficient passing of soft information due ...
Yuval Genga +2 more
doaj +1 more source
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 +3 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 +2 more
openaire +3 more sources
A Topological View of Reed–Solomon Codes
Mathematics, 2021 We studied a particular class of well known error-correcting codes known as Reed–Solomon codes. We constructed RS codes as algebraic-geometric codes from the normal rational curve.
Alberto Besana, Cristina Martínez
doaj +1 more source
Mathematics, 2020 We define a family of codes called twisted Hermitian codes, which are based on Hermitian codes and inspired by the twisted Reed–Solomon codes described by Beelen, Puchinger, and Nielsen. We demonstrate that these new codes can have high-dimensional Schur
Austin Allen +6 more
doaj +1 more source