Method of Binary Polyadic Sequences Structural Coding

Abstract

Describes an approach to constructing a method for encoding binary polyadic numbers. The method is based on the recurrent finding of the weight coefficients of the elements of structural numbers in a binary polyadic space and the identification of zero strings of the processed sequences. Thus, it becomes possible to reduce the total number of bits for the presentation of the initial data more significant, in comparison with standardized approaches to coding. A feature of the proposed method is the focus on reducing new types of redundancy. These types of redundancy include, in particular, in addition to statistical, also structural and combinatorial. Separately, it should be said that due to the simplicity and triviality of the method under consideration, its implementation in the existing technological basis does not require special conditions regarding the computing power of the hardware platform.