Abstract
In this paper, we consider some probability-theoretical models of information distortion at the message level. The checksum (CS) distributions typical of TCP-type protocols are investigated. As an addition operator in the CS, bitwise coordinate addition and binary addition with carryover are considered. For the distortion models described, asymptotic estimates of CS error probabilities are obtained at a small distortion probability. These asymptotic estimates can be useful for messages with long segments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Pronis, D., Tsifrovaya svyaz’ (Digital Communications), Moscow: Radio i svyaz’, 2000.
Tannenbaum, E. and Uezeroll, D., Komp’yuternye seti (Computer Networks), St. Petersburg: Piter, 2015.
Software Specification of the DARPA INTERNET Protocol. http://rfc.com/ru/rfc793.htm.
Baranov, A.P. and Baranov, P.A., Models of the formation of CRC values and monitoring sums under the conditions of multiple distortions, Autom. Control Comput. Sci., 2017, vol. 51, no. 8, pp. 959–964.
Vainshtein, L.A. and Zubakov, V.D., Vydelenie signalov na fone sluchainykh pomekh (Signal Discrimination under Random Interference), Moscow: Sovetskoe radio, 1960.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Translated by Yu. Kornienko
About this article
Cite this article
Baranov, A.P., Baranov, P.A. Estimating the Probability of a Checksum Error in a Message. Aut. Control Comp. Sci. 53, 874–878 (2019). https://doi.org/10.3103/S0146411619080066
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411619080066