Calculation of the detection properties in the binary symmetrical channel

Rychtář, Adam; Klapka, Štěpán; Kárná, Lucie

  • Programs and Algorithms of Numerical Mathematics, Publisher: Institute of Mathematics CAS(Prague), page 120-128

Abstract

top
One of the important parts of railway signalling systems design is the safety of communication, achievable - among others - with the error detecting code. Getting evidence of quantitative safety targets, especially the probability of undetected error of the code, is a surprisingly complicated issue. We've analysed 2048 irreducible self-adjoint generator polynomials of the degree 32. More than 70 of these have a maximum probability of failure lower than the standard codes generally used. In this article we present the best of all codes we've analysed.

How to cite

top

Rychtář, Adam, Klapka, Štěpán, and Kárná, Lucie. "Calculation of the detection properties in the binary symmetrical channel." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics CAS, 2021. 120-128. <http://eudml.org/doc/296906>.

@inProceedings{Rychtář2021,
abstract = {One of the important parts of railway signalling systems design is the safety of communication, achievable - among others - with the error detecting code. Getting evidence of quantitative safety targets, especially the probability of undetected error of the code, is a surprisingly complicated issue. We've analysed 2048 irreducible self-adjoint generator polynomials of the degree 32. More than 70 of these have a maximum probability of failure lower than the standard codes generally used. In this article we present the best of all codes we've analysed.},
author = {Rychtář, Adam, Klapka, Štěpán, Kárná, Lucie},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {error correcting codes; error probability; safety codes},
location = {Prague},
pages = {120-128},
publisher = {Institute of Mathematics CAS},
title = {Calculation of the detection properties in the binary symmetrical channel},
url = {http://eudml.org/doc/296906},
year = {2021},
}

TY - CLSWK
AU - Rychtář, Adam
AU - Klapka, Štěpán
AU - Kárná, Lucie
TI - Calculation of the detection properties in the binary symmetrical channel
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2021
CY - Prague
PB - Institute of Mathematics CAS
SP - 120
EP - 128
AB - One of the important parts of railway signalling systems design is the safety of communication, achievable - among others - with the error detecting code. Getting evidence of quantitative safety targets, especially the probability of undetected error of the code, is a surprisingly complicated issue. We've analysed 2048 irreducible self-adjoint generator polynomials of the degree 32. More than 70 of these have a maximum probability of failure lower than the standard codes generally used. In this article we present the best of all codes we've analysed.
KW - error correcting codes; error probability; safety codes
UR - http://eudml.org/doc/296906
ER -

NotesEmbed ?

top

You must be logged in to post comments.