Results 21 to 30 of about 33,515 (176)
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
Reed-Solomon Coded Cooperative Spatial Modulation Based on Nested Construction for Wireless Communication [PDF]
This paper proposes the Reed-Solomon coded cooperative spatial modulation (RSCC-SM) scheme based on nested construction of two Reed-Solomon (RS) codes over quasi-static Rayleigh fading channel.
C. L. Zhao, F. F. Yang, D. K. Waweru
doaj
Error correction by Reed–Solomon codes using its automorphisms
The article explores the syndrome invariants of АГ-group of automorphisms of Reed–Solomon codes (RS-codes) that are a joint group of affine and cyclic permutations. The found real invariants are a set of norms of N Г-orbits that make up one or another АГ-
V. A. Lipnitsky, S. I. Semyonov
doaj +1 more source
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 is the number of symbols of a codeword.
Soro, Alexandre, Lacan, Jérôme
openaire +3 more sources
Performance Assessment of OFDM System using Reed-Solomon Codes over Fading Channels
This paper study the performance of Orthogonal Frequency Division Multiplexing (OFDM) system over AWGN and Rayleigh fading channels. OFDM performs multi-carrier transmission where all the subcarriers are orthogonal to each other.
N.M.A.E.D. Wirastuti +2 more
doaj +1 more source
List decoding of repeated codes [PDF]
Assuming that we have a soft-decision list decoding algorithm of a linear code, a new hard-decision list decoding algorithm of its repeated code is proposed in this article. Although repeated codes are not used for encoding data, due to their parameters,
Hernando, Fernando +2 more
core +4 more sources
Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature.
Martínez-Peñas, Umberto
core +1 more source
Subspace subcodes of Reed-Solomon codes [PDF]
We introduce a class of nonlinear cyclic error-correcting codes, which we call subspace subcodes of Reed-Solomon (SSRS) codes. An SSRS code is a subset of a parent Reed-Solomon (RS) code consisting of the RS codewords whose components all lie in a fixed ...
Hattori, Masayuki +2 more
core +1 more source
On deep holes of standard Reed-Solomon codes
Determining deep holes is an important open problem in decoding Reed-Solomon codes. It is well known that the received word is trivially a deep hole if the degree of its Lagrange interpolation polynomial equals the dimension of the Reed-Solomon code. For
Hong, Shaofang, Wu, Rongjun
core +1 more source
The Dimension of Subcode-Subfields of Shortened Generalized Reed Solomon Codes
Reed-Solomon (RS) codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures. However, RS codes suffer from having a fixed length.
Hernando, Fernando +2 more
core +1 more source

