Results 91 to 100 of about 19,178 (185)

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

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 transmitted codeword; this is in contrast to decoder failure, which occurs when the ...
Mceliece, R. J., Swanson, L.
core   +1 more source

COMPUTER MODELS OF SUDAN AND GURUSWAMI'S LIST DECODERS FOR GENERALIZED REED-SOLOMON CODES AND CONCATENATED CODES

Advanced Engineering Research, 2007
Problem of computer model development of Sudan and Guruswami's list decoders for generalized Reed-Solomon codes and concatenated codes is solved. Strict algorithm of list decoding of concatenated codes is given.
V.V. MKRTICHAN
doaj  

ROBUST BASEDBAND REED SOLOMON DETECTION OVER POWER LINE CHANNEL [PDF]

Journal of Engineering Science and Technology, 2011
The research studied the transmission of based-band data for conventional Reed Solomon Codes (RS) over hostile impulsive channel such as power-line channels (PLC).
PU CHUAN HSIAN
doaj  

Reed-Solomon Hybrid Codes for Optical Communications

Journal of Engineering and Sustainable Development, 2013
The astonishing performance of concatenated codes attracted many researchers and this has resulted in an explosive amount of literature since their introduction few years ago.
Awatif Ali Jafaar
doaj  

On the error statistics of Viterbi decoding and the performance of concatenated codes [PDF]

Computer simulation results are presented on the performance of convolutional codes of constraint lengths 7 and 10 concatenated with the (255, 223) Reed-Solomon code (a proposed NASA standard).
Butman, S. A., Deutsch, L. J., Miller, R. L.   +2 more
core   +1 more source

A Low-Complexity DEC Reed–Solomon Decoder Architecture Based on Subfield Decomposition

IEEE Access
This paper presents a low-complexity hardware architecture for a double-symbol-error-correcting (DEC) Reed-Solomon (RS) decoder. The architecture is based on the principle of subfield decomposition, replacing a shortened RS code over $\mathrm {GF}(2^{m})
Injae Yoo
doaj   +1 more source

Codificador RS(n,k) basado en LFCS: caso de estudio RS(7,3)

Revista Facultad de Ingeniería Universidad de Antioquia, 2012
El presente artículo presenta el diseño de un codi® cador Reed Solomon basado en un circuito concurrente, LFCS - Linear Feedback Concurrent Structure- que permite la generación de los símbolos de redundancia del código de forma paralela, siempre que se ...
Cecilia Sandoval-Ruiz
doaj  

Author Index

Pregnancy, Volume 2, Issue S1, January 2026.
wiley   +1 more source

1 Burst List Decoding of Interleaved Reed–Solomon Codes [PDF]

—It is shown that interleaved Reed–Solomon codes can be list-decoded for burst errors while attaining the generalized Reiger bound for list decoding. A respective decoding algorithm is presented which is (significantly) more efficient than a burst list ...
Ron M. Roth, Tom Kolan
core  

Recognition Errors Control in Biometric Identification Cryptosystems

Безопасность информационных технологий, 2015
The method of biometric cryptosystem designed on the basis of fuzzy extractor, in which main disadvantages of biometric and cryptographic systems are absent, is considered.
Vladimir Ivanovich Vasilyev, Ekaterina Viktorovna Buraya   +1 more
doaj