COMPARISON OF PROBABLE CODE NUMBER PNC AND CYCLIC REDUNDANCY CODE CRC
Statement of the problem: The need to ensure the integrity of data transmitted in communication networks, actualizes the issue of forming checksums used in the analysis of integrity. In this case, it is advisable to reduce the computational complexity of the algorithms for generating checksums. The aim of the work is to compare the computational complexity and error detection rates of the models for the formation of the probable number code PNC (Probable Number Code) and the cyclic redundancy code CRC (Cyclic Redundancy Code). The novelty of the work lies in the fact that PNC and CRC models were analyzed to compare the computational complexity and error detection rates. Result: on the basis of the analysis of the models, the reduction in the computational complexity of the algorithm for generating checksums in the PNC model in comparison with the CRC is confirmed. Practical significance: the model of the probable code of a number can be used in protocols of data transmission networks, as well as to substantiate the prospects for further research in this direction.