Results 61 to 70 of about 106,176 (185)

Coding for reliable satellite communications [PDF]

Several error control coding techniques for reliable satellite communications were investigated to find algorithms for fast decoding of Reed-Solomon codes in terms of dual basis. The decoding of the (255,223) Reed-Solomon code, which is used as the outer
Lin, S.
core   +1 more source

ON THE PROGRAM MODULE REALIZATION OF SUDAN DETERMINED DECODER FOR REED-SOLOMON CODES

Advanced Engineering Research, 2007
The program module of Sudan determined list decoder for Reed-Solomon codes is developed. The block diagram and program realization of decoder are constructed. A part of the realization is based on the effective factorization algorithm of Roth-Ruckenstein.
V.V. MKRTICHAN
doaj  

Generalized Reed-Solomon codes over number fields and exact gradient coding

AIMS Mathematics
This paper describes generalized Reed-Solomon (GRS) codes over number fields that are invariant under certain permutations. We call these codes generalized quasi-cyclic (GQC) GRS codes.
Irwansyah, Intan Muchtadi-Alamsyah, Fajar Yuliawan , Muhammad Irfan Hidayat   +3 more
doaj   +1 more source

Performance Evaluation of Selected Serial Concatenation Codes in AWGN & Frequency Selective Rayleigh Fading Channels

Journal of Engineering and Sustainable Development, 2011
Concatenation codes have attracted a great deal of interest since their discovery. They have been successfully used in digital communication systems in order to achieve reliable transmission on a noisy channel.
Amel M. Noori, Hikmat N. Abdullah
doaj  

A comparison of VLSI architectures for time and transform domain decoding of Reed-Solomon codes [PDF]

It is well known that the Euclidean algorithm or its equivalent, continued fractions, can be used to find the error locator polynomial needed to decode a Reed-Solomon (RS) code.
Deutsch, L. J., Hsu, I. S., Reed, I. S., Satorius, E. H., Truong, T. K.   +4 more
core   +1 more source

On the decoder error probability for Reed-Solomon codes [PDF]

, 1986
Upper bounds On the decoder error probability for Reed-Solomon codes are derived. By definition, "decoder error" occurs when the decoder finds a codeword other than the transitted codeword; this is in contrast to "decoder failure," which occurs when the ...
McEliece, Robert J., Swanson, Laif
core  

Reed-Solomon-Gabidulin Codes

, 2018
We introduce Reed-Solomon-Gabidulin codes which is, at the same time, an extension to Reed-Solomon codes on the one hand and Gabidulin codes on the other hand. We prove that our codes have good properties with respect to the minimal distance and design an efficient decoding algorithm.
Caruso, Xavier, Durand, Amaury
openaire   +2 more sources

Discrete logarithm computations over finite fields using Reed-Solomon codes [PDF]

, 2012
Cheng and Wan have related the decoding of Reed-Solomon codes to the computation of discrete logarithms over finite fields, with the aim of proving the hardness of their decoding.
Augot, Daniel, Morain, François
core   +3 more sources

Modified Welch Berlekamp Algorithm to Decode Reed Solomon Codes

MATEC Web of Conferences, 2018
In this paper, the Reed Solomon Code is decoded using the Welch-Berlekamp Algorithm. The RS Decoder is implemented using Hardware Description Language VHDL (VHSIC hardware Description Language) and simulated on Modelsim software.
Mahmudi Ali, Achmadi Sentot, Michael
doaj   +1 more source

A new VLSI architecture for a single-chip-type Reed-Solomon decoder [PDF]

A new very large scale integration (VLSI) architecture for implementing Reed-Solomon (RS) decoders that can correct both errors and erasures is described. This new architecture implements a Reed-Solomon decoder by using replication of a single VLSI chip.
Hsu, I. S., Truong, T. K.
core   +1 more source