Results 21 to 30 of about 106,176 (185)

FNT-Based Reed-Solomon Erasure Codes [PDF]

open access: yes2010 7th IEEE Consumer Communications and Networking Conference, 2010
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

GENERIC REED SOLOMON ENCODER

open access: yesMAKARA of Science Series, 2010
Reed Solomon (RS) codes is a mechanism to detect and correct burst of errors in data transmission and storage systems. It provides a solid introduction to foundation mathematical concept of Galois Field algebra and its application. With the development of digital hardware technology, the RS concepts were brought into reality, i.e. the implementation of
openaire   +2 more sources

RS(n,k) Encoder based on LFCS

open access: yesRevista Facultad de Ingeniería Universidad de Antioquia, 2012
This article presents the design of a Reed Solomon encoder circuit based on a concurrent LFCS -Linear Structure Concurrent Feedback-allowing the generation of code redundancy symbols in parallel, provided that you supply the k information symbols to ...
Cecilia Sandoval-Ruiz
doaj   +1 more source

Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring

open access: yes, 2018
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

RTL development of a parameterizable Reed–Solomon Codec

open access: yesIET Computers & Digital Techniques, 2021
Error correction coding (ECC) methods have been considered essential constituents of data transmission systems. Reed–Solomon (RS) codes are a core ECC technique that have been adopted in numerous applications and standards.
Mateus G. Silva   +2 more
doaj   +1 more source

Application of the Reed-Solomon Algorithm as a Remote Sensing Data Fusion Tool for Land Use Studies

open access: yesAlgorithms, 2020
The Reed-Solomon algorithm is well known in different fields of computer science. The novelty of this study lies in the different interpretation of the algorithm itself and its scope of application for remote sensing, especially at the preparatory stage,
Piotr A. Werner
doaj   +1 more source

VLSI single-chip (255,223) Reed-Solomon encoder with interleaver [PDF]

open access: yes, 1990
The invention relates to a concatenated Reed-Solomon/convolutional encoding system consisting of a Reed-Solomon outer code and a convolutional inner code for downlink telemetry in space missions, and more particularly to a Reed-Solomon encoder with ...
Deutsch, Leslie J.   +3 more
core   +1 more source

On deep holes of standard Reed-Solomon codes

open access: yes, 2012
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

Performance Assessment of OFDM System using Reed-Solomon Codes over Fading Channels

open access: yesJournal of Electrical, Electronics and Informatics, 2018
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

On Determining Deep Holes of Generalized Reed-Solomon Codes

open access: yes, 2013
For a linear code, deep holes are defined to be vectors that are further away from codewords than all other vectors. The problem of deciding whether a received word is a deep hole for generalized Reed-Solomon codes is proved to be co-NP-complete. For the
Cheng, Qi, Li, Jiyou, Zhuang, Jincheng
core   +1 more source

Home - About - Disclaimer - Privacy