|
Problemy Peredachi Informatsii, 2010, Volume 46, Issue 2, Pages 30–46
(Mi ppi2014)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Coding Theory
Multitrial decoding of concatenated codes using fixed thresholds
C. Sengera, V. R. Sidorenkoab, M. Bosserta, V. V. Zyablovb a University of Ulm, Germany
b A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
For decoding concatenated codes up to half their designed distance, generalized minimum distance (GMD) decoding can be used. GMD decoding applies multitrial error/erasure decoding of the outer code, where erased symbols depend on some reliability measure stemming from the inner decoders. We consider the case where the outer decoder is able to decode beyond half the minimum distance of the outer code. For a given number of outer decoding trials, we derive achievable decoding radii for GMD decoding. Vice versa, we give a lower bound on the number of required outer decoding trials to obtain the greatest possible decoding radius.
Received: 05.11.2008 Revised: 29.12.2009
Citation:
C. Senger, V. R. Sidorenko, M. Bossert, V. V. Zyablov, “Multitrial decoding of concatenated codes using fixed thresholds”, Probl. Peredachi Inf., 46:2 (2010), 30–46; Problems Inform. Transmission, 46:2 (2010), 127–141
Linking options:
https://www.mathnet.ru/eng/ppi2014 https://www.mathnet.ru/eng/ppi/v46/i2/p30
|
Statistics & downloads: |
Abstract page: | 500 | Full-text PDF : | 118 | References: | 62 | First page: | 8 |
|