بهینه‌سازی کدهای دودویی

All binary codes, even Huffman optimal code, are kind of non-optimal bit arrangement. Therefore, binary code optimization is a challenging problem. In this paper an algorithm is proposed to optimize the codes by converting any type of binary code to a specific type of Shannon-Fano code. Shannon-Fano...

Full description

Bibliographic Details
Main Authors: پرویز قره باقری, سید حمید حاج سید جوادی, پروانه اصغری
Format: Article
Language:fas
Published: Computer Society of Iran 2021-09-01
Series:علوم رایانش و فناوری اطلاعات
Online Access:https://jcsit.ir/ojs/index.php/jcsit/article/view/76
_version_ 1798014085097324544
author پرویز قره باقری
سید حمید حاج سید جوادی
پروانه اصغری
author_facet پرویز قره باقری
سید حمید حاج سید جوادی
پروانه اصغری
author_sort پرویز قره باقری
collection DOAJ
description All binary codes, even Huffman optimal code, are kind of non-optimal bit arrangement. Therefore, binary code optimization is a challenging problem. In this paper an algorithm is proposed to optimize the codes by converting any type of binary code to a specific type of Shannon-Fano code. Shannon-Fano codes are a type of coding with variable length, a state of these codes in the form of word codes in which in each word code there is only one bit "0" or one bit "1" at the beginning or end of the word code. Thus, considering this feature, we find that all binary values ​​are a special type of Shannon-Fano code, so given the frequency of the code, it is possible to replace word codes such as Huffman's code that are optimal comparing Shannon-Fano that optimizes the code arrangement. A considerable feature of this method is the positive return for each type of input data consisting of any type of bit combination, meaning that regardless of the code table, the efficiency of the algorithm will always be positive or equal to zero. Also, the proposed method can use symmetric word codes instead of Huffman word codes to creating symmetric codes, with reversibility and error resistance with two-way decoding.
first_indexed 2024-04-11T15:11:54Z
format Article
id doaj.art-921c0c6fabb54dccabbca63ce54f325f
institution Directory Open Access Journal
issn 2676-5438
language fas
last_indexed 2024-04-11T15:11:54Z
publishDate 2021-09-01
publisher Computer Society of Iran
record_format Article
series علوم رایانش و فناوری اطلاعات
spelling doaj.art-921c0c6fabb54dccabbca63ce54f325f2022-12-22T04:16:37ZfasComputer Society of Iranعلوم رایانش و فناوری اطلاعات2676-54382021-09-0119146بهینه‌سازی کدهای دودوییپرویز قره باقری0سید حمید حاج سید جوادی1پروانه اصغری2دانشگاه شاهددانشگاه شاهددانشگاه آزاد اسلامی واحد تهران مرکزیAll binary codes, even Huffman optimal code, are kind of non-optimal bit arrangement. Therefore, binary code optimization is a challenging problem. In this paper an algorithm is proposed to optimize the codes by converting any type of binary code to a specific type of Shannon-Fano code. Shannon-Fano codes are a type of coding with variable length, a state of these codes in the form of word codes in which in each word code there is only one bit "0" or one bit "1" at the beginning or end of the word code. Thus, considering this feature, we find that all binary values ​​are a special type of Shannon-Fano code, so given the frequency of the code, it is possible to replace word codes such as Huffman's code that are optimal comparing Shannon-Fano that optimizes the code arrangement. A considerable feature of this method is the positive return for each type of input data consisting of any type of bit combination, meaning that regardless of the code table, the efficiency of the algorithm will always be positive or equal to zero. Also, the proposed method can use symmetric word codes instead of Huffman word codes to creating symmetric codes, with reversibility and error resistance with two-way decoding.https://jcsit.ir/ojs/index.php/jcsit/article/view/76
spellingShingle پرویز قره باقری
سید حمید حاج سید جوادی
پروانه اصغری
بهینه‌سازی کدهای دودویی
علوم رایانش و فناوری اطلاعات
title بهینه‌سازی کدهای دودویی
title_full بهینه‌سازی کدهای دودویی
title_fullStr بهینه‌سازی کدهای دودویی
title_full_unstemmed بهینه‌سازی کدهای دودویی
title_short بهینه‌سازی کدهای دودویی
title_sort بهینه‌سازی کدهای دودویی
url https://jcsit.ir/ojs/index.php/jcsit/article/view/76
work_keys_str_mv AT prwyzqrhbạqry bhynhsạzyḵdhạydwdwyy
AT sydḥmydḥạjsydjwạdy bhynhsạzyḵdhạydwdwyy
AT prwạnhạṣgẖry bhynhsạzyḵdhạydwdwyy