Please use this identifier to cite or link to this item: https://essuir.sumdu.edu.ua/handle/123456789/82213
Or use following links to share this resource in social networks: Recommend this item
Title Estimating the indivisible error detecting сodes based on an average probability method
Authors Borysenko, Oleksii Andriiovych  
Matsenko, Svitlana Mykhailivna  
Novhorodtsev, Anatolii Ivanovych
Kobiakov, Oleksandr Mykolaiovych
Spolitis, S.
Bobrovs, V.
Keywords average probability method
indivisible code
error-detecting code
undetectable error
reliability
метод середньої ймовірності
неподільний код
код виявлення помилок
невизначена помилка
надійність
метод средней вероятности
неделимый код
код обнаружения ошибок
необнаруживаемая ошибка
надежность
Type Article
Date of Issue 2020
URI https://essuir.sumdu.edu.ua/handle/123456789/82213
Publisher Technology Center
License Creative Commons Attribution 4.0 International License
Citation Estimating the indivisible error detecting сodes based on an average probability method / Oleksiy Borysenko, Svitlana Matsenko, Anatolii Novhorodtsev, Oleksandr Kobyakov, Sandis Spolitis, Vjaceslavs Bobrovs. Eastern-European Journal of Enterprise Technologies. 2000. Vol. 6, № 9. Р. 25-33.
Abstract Given the need to improve the efficiency of data transfer, there are requirements to ensure their reliability and quality under interference. One way to improve data transfer efficiency is to use noise-resistant codes, which include a closed-form expression of the Fibonacci code, a parity check code, and a constant weight code. The result of applying these types of coding produces interference-resistant end-to-end processing and transmission of information, which is a promising approach to improving the efficiency of telecommunications systems in today's environment. This paper reports the estimation of the error detecting code capability of the Fibonacci code in a closed-form expression, as well as its comparative characteristic with a parity check code and a constant weight code for a binary symmetrical channel without memory. To assess an error detecting capability of the Fibonacci code in a closed-form expression, the probability of Fibonacci code combinations moving to the proper, allowable, and prohibited classes has been determined. The comparative characteristic of the indivisible error-detecting codes is based on an average probability method, for the criterion of an undetectable error probability, employing the MATLAB and Python software. The method has demonstrated the simplicity, versatility, and reliability of estimation, which is close to reality. The probability of an undetectable error in the Fibonacci code in a closed-form expression is V=5×10-7; in a code with parity check, V=7.7×10-15; and in a constant weight code, V=1.9×10-15, at p10=3×10-9. The use of the average probability method makes it possible to effectively use indivisible codes for detecting errors in telecommunications systems.
Appears in Collections: Наукові видання (ЕлІТ)

Views

Ukraine Ukraine
10

Downloads

Ukraine Ukraine
11

Files

File Size Format Downloads
Borysenko_Estimating_the_Indivisible_Error.pdf 891,71 kB Adobe PDF 11

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.