Generalized minimum distance (GMD) decoders allow for combining some virtues of probabilistic and algebraic decoding approaches at a low complexity. We investigate single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff, based on either erasing a fraction of the received symbols or erasing all symbols whose reliability values are below a certain threshold. The fraction/threshold may be either static or adaptive, where adaptive means that the erasing is a function of the channel output. Adaptive erasing based on a threshold is a new technique that has not been investigated before. An asymptotic approach is used to evaluate the error-correction radius for each strategy. Both known and new results appear as special cases of this general framework.
Description
Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff | SpringerLink
%0 Journal Article
%1 Weber2012
%A Weber, J. H.
%A Sidorenko, V. R.
%A Senger, C.
%A Abdel-Ghaffar, K. A. S.
%D 2012
%J Problems of Information Transmission
%K myown from:christiansenger
%N 4
%P 324--333
%R 10.1134/S0032946012040023
%T Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
%U https://doi.org/10.1134/S0032946012040023
%V 48
%X Generalized minimum distance (GMD) decoders allow for combining some virtues of probabilistic and algebraic decoding approaches at a low complexity. We investigate single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff, based on either erasing a fraction of the received symbols or erasing all symbols whose reliability values are below a certain threshold. The fraction/threshold may be either static or adaptive, where adaptive means that the erasing is a function of the channel output. Adaptive erasing based on a threshold is a new technique that has not been investigated before. An asymptotic approach is used to evaluate the error-correction radius for each strategy. Both known and new results appear as special cases of this general framework.
@article{Weber2012,
abstract = {Generalized minimum distance (GMD) decoders allow for combining some virtues of probabilistic and algebraic decoding approaches at a low complexity. We investigate single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff, based on either erasing a fraction of the received symbols or erasing all symbols whose reliability values are below a certain threshold. The fraction/threshold may be either static or adaptive, where adaptive means that the erasing is a function of the channel output. Adaptive erasing based on a threshold is a new technique that has not been investigated before. An asymptotic approach is used to evaluate the error-correction radius for each strategy. Both known and new results appear as special cases of this general framework.},
added-at = {2020-03-10T17:15:44.000+0100},
author = {Weber, J. H. and Sidorenko, V. R. and Senger, C. and Abdel-Ghaffar, K. A. S.},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2d56d05b548dbc9de8e38c3dea83279f6/inue},
day = 01,
description = {Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff | SpringerLink},
doi = {10.1134/S0032946012040023},
interhash = {a71164d58532785b692fd9a537a58b41},
intrahash = {d56d05b548dbc9de8e38c3dea83279f6},
issn = {1608-3253},
journal = {Problems of Information Transmission},
keywords = {myown from:christiansenger},
month = oct,
number = 4,
pages = {324--333},
timestamp = {2020-03-10T16:15:44.000+0100},
title = {Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff},
url = {https://doi.org/10.1134/S0032946012040023},
volume = 48,
year = 2012
}
