Results 21 to 30 of about 868,467 (209)
Balanced Reed-Solomon codes [PDF]
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 +5 more sources
Weighted Reed–Solomon convolutional codes
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 +3 more
openaire +5 more sources
Quantum Reed—Solomon Codes [PDF]
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 errors. This error model - the quantum erasure channel - is discussed.
Markus Grassl +2 more
openaire +2 more sources
FNT-based reed-solomon erasure codes [PDF]
This paper presents a new construction of Maximum-Distance Separable (MDS) Reed-Solomon erasure codes based on Fermat Number Transform (FNT). Thanks to FNT, these codes support practical coding and decoding algorithms with complexity O(n log n), where n ...
Soro, Alexandre +3 more
core +1 more source
Reed-Solomon Codes (Codici di Reed-Solomon) [PDF]
This work offers a general overview on Reed-Solomon codes as a subclass of cyclic codes and BCH codes, using a mathematical approach to describe their practical aspects.
Martini, Tommaso
core
Reed-Solomon Codes - Error Correcting Codes
In the following pages an introduction of the error correcting codes known as Reed-Solomon codes will be presented together with different approaches for decoding. This is supplemented by a Mathematica program and a description of this program that gives an understanding in how the choice of decoding algorithms affect the time it takes to find errors ...
Skoglund, Isabell
openaire +3 more sources
Coding Concepts and Reed-Solomon Codes
The material in this book is presented to graduate students in Information and Communication theory. The idea is that we give an introduction to particular applications of information theory and coding in digital communications. The goal is to bring understanding of the underlying concepts, both in theory as well as in practice.
openaire +2 more sources
Proximity Gaps for Reed–Solomon Codes
A collection of sets displays a proximity gap with respect to some property if for every set in the collection, either (i) all members are δ-close to the property in relative Hamming distance or (ii) only a tiny fraction of members are δ-close to the property.
Eli Ben-Sasson +4 more
openaire +6 more sources
Mã Reed-Solomon (mã RS) là một trong những phương pháp mạnh mẽ nhất để bảo vệ tính toàn vẹn của dữ liệu khỏi các lỗi có thể xảy ra trong quá trình lưu trữ hoặc truyền tải. Kỹ thuật mã hóa này đã được chứng minh đạt được hiệu suất cao với chi phí hợp lý.
Nguyễn Thị Lan Hương +4 more
openaire +1 more source
Error Probability Mitigation in Quantum Reading Using Classical Codes
A general framework describing the statistical discrimination of an ensemble of quantum channels is given by the name quantum reading. Several tools can be applied in quantum reading to reduce the error probability in distinguishing the ensemble of ...
Francisco Revson Fernandes Pereira +1 more
doaj +1 more source

