Method of Binary Polyadic Sequences Structural Coding
Vladimir Barannik, Valeriy Barannik, Роман Лазута et al. · IEEE International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET) · 2022
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.
Cited by 1 works. doi:10.1109/tcset55632.2022.9767005
Authors
References
- Visual cryptography
- JPEG2000 Image Compression Fundamentals, Standards and Practice
- The JPEG 2000 still image compression standard
- Vector quantization using the firefly algorithm for image compression
- Utility-Driven Adaptive Preprocessing for Screen Content Video Compression
- The analysis of the use of technologies of error resilient coding at influence of an error in the codeword
- Error-resilient coding for underwater video transmission
- Still image/video frame lossy compression providing a desired visual quality
- The issue of timely delivery of video traffic with controlled loss of quality
- Low-Complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform