COMPUTER MODELS OF SUDAN AND GURUSWAMI'S LIST DECODERS FOR GENERALIZED REED-SOLOMON CODES AND CONCATENATED CODES
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. The block diagram and program realization of decoder are constructed.
Saved in:
| Main Author: | V.V. MKRTICHAN |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Don State Technical University
2007-12-01
|
| Series: | Advanced Engineering Research |
| Online Access: | https://www.vestnik-donstu.ru/jour/article/view/1319 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The automorphisms and error orbits of Reed – Solomon codes
by: S. I. Semyonov, et al.
Published: (2020-06-01) -
ANALYTICAL MODEL OF NOISE STABILITY CALCULATION OF SYSTEMS WITH MULTIPOSITIONAL MODULATION AND CODING BY REED-SOLOMON ALGORITHM
by: E. B. Lipkovich, et al.
Published: (2020-03-01) -
Decoding Reed- Muller Codes by Using Hadamard Matrices
by: Baghdad Science Journal
Published: (2009-12-01) -
Reduced complexity hard‐ and soft‐input BCH decoding with applications in concatenated codes
by: Jürgen Freudenberger, et al.
Published: (2021-05-01) -
Correcting capacity of soft-decision decoder of ternary Reed - Muller second-order codes with a large number of errors
by: Nadezhda Sergeyevna Mogilevskaya
Published: (2015-03-01)