preprint · arXiv (Cornell University) · 2021
Binary code optimization
Parviz Gharehbagheri, Sayeed Hamid Haji Sayeed Javadi, Parvaneh Asghari, Naser Gharehbagheri
Cited by 0Open access
Abstract
This article shows that any type of binary data can be defined as a collection from codewords of variable length. This feature helps us to define an Injective and surjective function from the suggested codewords to the required codewords. Therefore, by replacing the new codewords, the binary data becomes another binary data regarding the intended goals. One of these goals is to reduce data size. It means that instead of the original codewords of each binary data, it replaced the Huffman codewords to reduce the data size. One of the features of this method is the result of positive compression for any type of binary data, that is, regardless of the size of the code table, the difference between the original data size and the data size after compression will be greater than or equal to zero. Another important and practical feature of this method is the use of symmetric codewords instead of the suggested codewords in order to create symmetry, reversibility and error resistance properties with two-way decoding.
Cite this paper
Gharehbagheri, P., Javadi, S. H. H. S., Asghari, P., & Gharehbagheri, N. (2021). Binary code optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2110.00917
Gharehbagheri, Parviz, et al. “Binary code optimization.” arXiv (Cornell University), 2021, https://doi.org/10.48550/arxiv.2110.00917.
Gharehbagheri, Parviz, Sayeed Hamid Haji Sayeed Javadi, Parvaneh Asghari, and Naser Gharehbagheri. 2021. “Binary code optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2110.00917.
Gharehbagheri, P. et al. (2021) ‘Binary code optimization’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.2110.00917.
@misc{gharehbagheri2021binary,
title = {{Binary code optimization}},
author = {Gharehbagheri, Parviz and Javadi, Sayeed Hamid Haji Sayeed and Asghari, Parvaneh and Gharehbagheri, Naser},
journal = {arXiv (Cornell University)},
year = {2021},
doi = {10.48550/arxiv.2110.00917}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
CoXoH: Low cost energy efficient data compression for wireless sensor nodes using data encoding
Syed Ishtiaq Hussian, Huma Javed, Waheed ur Rehman et al. · International Conference on Computer Networks and Information Technology (ICCNIT) · 2011
Cited by 4
Data Compression using Huffman based LZW
Rubaiyat Hasan · 2011
Cited by 0
Towards new algorithms for data compression using adaptive codes
Dragoş Trincă · International Conference on Information Technology: Coding and Computing (ITCC) · 2004
Cited by 6
Predictive data compression using adaptive arithmetic coding
Claudio Iombo · Louisiana State University · 2007
Cited by 4Open access
Enhancing Data Compression: A Dynamic Programming Approach with Huffman Coding and Burrows-Wheeler Transform
Sairudra More, Vrinda Sanivarapu, Yukta Sharma et al. · International Conference on Automation, Computing and Renewable Systems (ICACRS) · 2023
Cited by 4
A Lossless Compression Algorithm Based on Differential and Canonical Huffman Encoding for Spaceborne Magnetic Data
Li Li, Huijie Liu, Ye Zhu et al. · International Conference on Image, Video and Signal Processing (IVSP) · 2020
Cited by 7
Параллельный алгоритм кодирования по Хаффману на GPU и его применение в СУБД MySQL
Дмитрий Александрович Лыфарь, И. Ю. Кулаков · Herald of Omsk University Series Psychology · 2011
Cited by 0