Iterative decoding of product codes constructed from constituent generalized Reed-Solomon codes (or subcodes thereof, such as Bose-Chaudhuri-Hocquenghem codes) is considered. In each iteration, the received symbols are updated according to horizontal and vertical decoding steps using a bounded distance decoder for the constituent codes. Symbols that were static for by a certain number of past iterations are considered trustworthy and it is assumed that they coincide with the originally transmitted codeword symbols. This enables list decoding of the constituent codes under partial codeword knowledge as proposed just recently. As a result, lower symbol error rates after decoding can be obtained.
%0 Conference Paper
%1 senger2019improved
%A Senger, Christian
%B 2019 IEEE International Symposium on Information Theory (ISIT)
%D 2019
%I IEEE
%K sent ubs_10005 ubs_20007 ubs_30073 ubs_40406 unibibliografie
%P 1342-1346
%R 10.1109/ISIT.2019.8849469
%T Improved Iterative Decoding of Product Codes Based on Trusted Symbols
%X Iterative decoding of product codes constructed from constituent generalized Reed-Solomon codes (or subcodes thereof, such as Bose-Chaudhuri-Hocquenghem codes) is considered. In each iteration, the received symbols are updated according to horizontal and vertical decoding steps using a bounded distance decoder for the constituent codes. Symbols that were static for by a certain number of past iterations are considered trustworthy and it is assumed that they coincide with the originally transmitted codeword symbols. This enables list decoding of the constituent codes under partial codeword knowledge as proposed just recently. As a result, lower symbol error rates after decoding can be obtained.
%@ 978-1-5386-9291-2 and 978-1-5386-9290-5 and 978-1-5386-9292-9
@inproceedings{senger2019improved,
abstract = {Iterative decoding of product codes constructed from constituent generalized Reed-Solomon codes (or subcodes thereof, such as Bose-Chaudhuri-Hocquenghem codes) is considered. In each iteration, the received symbols are updated according to horizontal and vertical decoding steps using a bounded distance decoder for the constituent codes. Symbols that were static for by a certain number of past iterations are considered trustworthy and it is assumed that they coincide with the originally transmitted codeword symbols. This enables list decoding of the constituent codes under partial codeword knowledge as proposed just recently. As a result, lower symbol error rates after decoding can be obtained.},
added-at = {2020-03-11T15:51:43.000+0100},
author = {Senger, Christian},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2673880c453e8f975af735eb6a0b2120c/unibiblio},
booktitle = {2019 IEEE International Symposium on Information Theory (ISIT)},
doi = {10.1109/ISIT.2019.8849469},
eventdate = {2019-07-07/2019-07-12},
eventtitle = {2019 IEEE International Symposium on Information Theory (ISIT)},
interhash = {9b5162447c2d47690876e6097f635b73},
intrahash = {673880c453e8f975af735eb6a0b2120c},
isbn = {{978-1-5386-9291-2} and {978-1-5386-9290-5} and {978-1-5386-9292-9}},
keywords = {sent ubs_10005 ubs_20007 ubs_30073 ubs_40406 unibibliografie},
pages = {1342-1346},
publisher = {IEEE},
timestamp = {2020-03-11T14:51:43.000+0100},
title = {Improved Iterative Decoding of Product Codes Based on Trusted Symbols},
venue = {Paris, France},
year = 2019
}
