Mironkin Vladimir O. (Candidate of Physical and Mathematical Sciences, Associate Professor of the Department of Computer Security, Moscow Institute of Electronics and Mathematics of the National Research University Higher School of Economics)
Sheikin Vsevolod V. (lecturer at the Computer Security Department, Moscow Institute of Electronics and Mathematics, National Research University Higher School of Economics)
Astvatsatryan Georgy L. (Moscow Institute of Electronics and Mathematics, National Research University Higher School of Economics)
Kochkonyan Garik G. (Moscow Institute of Electronics and Mathematics, National Research University Higher School of Economics)
Surkov Maxim A. (Moscow Institute of Electronics and Mathematics, National Research University Higher School of Economics)
| |
The article discusses one of the approaches to constructing complete code trees and the related problem of constructing optimal prefix codes. The assumption is formulated and proven that the value of the ratio of the number of terminal vertices to the total number of vertices in a complete D-ary tree tends to the value given by the formula: P_leaf = 1-1/D, where P_leaf is the proportion of terminal vertices. A new algorithm for generating a prefix code has been developed, using the method of randomly selecting end vertices in a complete D-ary tree of arbitrary height n, as well as a test bench that visually implements this algorithm.
Keywords:code trees, complete code trees, prefix codes, algorithm for constructing prefix codes
|
|
| |
|
Read the full article …
|
Citation link:
Mironkin V. O., Sheikin V. V., Astvatsatryan G. L., Kochkonyan G. G., Surkov M. A. ABOUT ONE APPROACH TO CONSTRUCTION OF COMPLETE CODE TREES // Современная наука: актуальные проблемы теории и практики. Серия: Естественные и Технические Науки. -2024. -№09. -С. 76-79 DOI 10.37882/2223-2966.2024.9.22 |
|
|
