Page 1

Displaying 1 – 3 of 3

Showing per page

Calculation of the detection properties in the binary symmetrical channel

Rychtář, Adam, Klapka, Štěpán, Kárná, Lucie (2021)

Programs and Algorithms of Numerical Mathematics

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...

On the Error-Correcting Performance of some Binary and Ternary Linear Codes

Baicheva, Tsonka (2007)

Serdica Journal of Computing

In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision for a linear...

Currently displaying 1 – 3 of 3

Page 1