The method of pseudorandom codes decoding on the basis of the modified method of branches and boundaries

Authors

  • Таміла Лавровська V. N. Karazin Kharkiv National University image/svg+xml
  • Сергій Рассомахін V. N. Karazin Kharkiv National University image/svg+xml

Keywords:

pseudorandom code, branch and bound method, computational complexity, error-correcting coding

Abstract

Reasons of crisis of error-correcting coding are considered. Underlined the urgency of application of pseudo random codes in modern systems transmission of information. Presented constructive mathematical method of decoding pseudorandom codes based on the use of the method of branches and borders. Is proposed for modification of the classical algorithm of branch and bound. Is proposed, assessment of computing complexity of methods of decoding of pseudorandom codes on basis of the classical and modified algorithm of branches and boundaries is made, and also assessment of computing complexity of the offered method in comparison with exhaustive search method.  Program implementation of method of decoding of pseudorandom codes is developed.

Author Biographies

  • Таміла Лавровська, V. N. Karazin Kharkiv National University
    PhD student
  • Сергій Рассомахін, V. N. Karazin Kharkiv National University

    Doctor of Sciences (Engineering), Full Prof., Academician of the Academy of Applied Radioelectronics Sciences, head of the Department of information systems and technologies security

Downloads

Published

2017-04-24

Issue

Section

Статті

How to Cite

The method of pseudorandom codes decoding on the basis of the modified method of branches and boundaries. (2017). Computer Science and Cybersecurity, 1, 4-21. https://periodicals.karazin.ua/cscs/article/view/8293

Most read articles by the same author(s)