scholarly journals Data Compression Using Shannon-Fano Algorithm

d'CARTESIAN ◽  
2013 ◽  
Vol 2 (2) ◽  
pp. 10 ◽  
Author(s):  
Christine Lamorahan ◽  
Benny Pinontoan ◽  
Nelson Nainggolan
Keyword(s):  
Data Compression ◽  
Communication Systems ◽  
Data Transfer ◽  
Transfer System ◽  
Compression Process ◽  
Text Data ◽  
Information And Communication ◽  
Huffman Algorithm ◽  
The Media ◽  
Fano Algorithm

Abstract Communication systems in the world of technology, information and communication are known as data transfer system. Sometimes the information received lost its authenticity, because size of data to be transferred exceeds the capacity of the media used. This problem can be reduced by applying compression process to shrink the size of the data to obtain a smaller size. This study considers compression for data text using Shannon – Fano algorithm and shows how effective these algorithms in compressing it when compared with the Huffman algorithm. This research shows that text data compression using Shannon-Fano algorithm has a same effectiveness with Huffman algorithm when all character in string all repeated and when the statement short and just one character in the statement that repeated, but the Shannon-Fano algorithm more effective then Huffman algorithm when the data has a long statement and data text have more combination character in statement or in string/ word. Keywords: Data compression, Huffman algorithm, Shannon-Fano algorithm Abstrak Sistem komunikasi dalam dunia teknologi informasi dan komunikasi dikenal sebagai sistem transfer data. Informasi yang diterima kadang tidak sesuai dengan aslinya, dan salah satu penyebabnya adalah besarnya ukuran data yang akan ditransfer melebihi kapasitas media yang digunakan. Masalah ini dapat diatasi dengan menerapkan proses kompresi untuk mengecilkan ukuran data yang besar sehingga diperoleh ukuran yang lebih kecil. Penelitian ini menunjukan salah satu kompresi untuk data teks dengan menggunakan algoritma Shannon – Fano serta menunjukan seberapa efektif algoritma tersebut dalam mengkompresi data jika dibandingkan dengan algoritma Huffman. Kompresi untuk data teks dengan algoritma Shannon-Fano menghasilkan suatu data dengan ukuran yang lebih kecil dari data sebelumnya dan perbandingan dengan algoritma Huffman menunjukkan bahwa algoritma Shannon- Fano memiliki keefektifan yang sama dengan algoritma Huffman jika semua karakter yang ada di data berulang dan jika dalam satu kalimat hanya ada satu karakter yang berulang, tapi algoritma Shannon-Fano lebih efektif jika kalimat lebih panjang dan jumlah karakter di dalam kalimat atau kata lebih banyak dan beragam. Kata kunci: Algoritma Huffman, Algoritma Shannon-Fano, Kompresi data

scholarly journals Towards A Supranational Media Theory

2018 ◽  
Vol 9 (34) ◽  
pp. 119-139
Author(s):  
Fatih ARTUN ◽  
Sevki ISIKLI
Keyword(s):  
New Media ◽  
Mass Communication ◽  
Communication Systems ◽  
Data Transfer ◽  
New Order ◽  
Social Experiment ◽  
Satellite Systems ◽  
Media Companies ◽  
Wide Range ◽  
The Media

Satellite systems and the Internet have created a significant alternative that undermines the traditional reporting approach and triggered the search for a new order in mass communication. Instant and interactive data transfer systems have transformed local users into global readers and reporters encouraging a trend of democratization relative to freedom of thought and expression. Content providers and distributors in the traditional news industry which is televisions, magazines, radios, newspapers, online platforms, have a wide range of freedom to reach people. Consumers who use interactive mass communication systems have opportunities to interact with the content that is produced in many different centers. However, in the presence of the media defined as a mechanism that manufactures the consent of people for certain ideas, no matter if they are traditional or novel, people sometimes take the position of a buyer or an activist who takes action for a project and sometimes a part of a group of insusceptible people. People think their consent is their freewill without noticing that it is just a product. They feel a sense of gratitude to the ruling elites without noticing that they are the subjects of a social experiment and under the hypnotic influence of the media. Even though the world societies are getting the same content using the same communication technologies thanks to supranational media companies. Particularly because of content created to convey a message, social differences become more explicit and radical rather than the values in common. That’s why conflicts are incited. At the heart of the majority of new media organization debates, the existence of this problematic information lies. This article, which has been prepared with an analytical approach based on a literature review, discusses the theoretical conditions and the possibility of a new supranational media structure that world citizens need as a source of information. The philosophical basis of the supranational media ideal in question is at the heart of cosmopolitan individuals and eternal peace ideals of The Universal Declaration of Human Rights. The present media are unable to produce content that doesn’t try to convey a message as it positions individuals as “consumers or user” rather than “people”. Here, supranational media depicting theoretical conditions doesn’t seek profit. It introduces individuals and cultures with their diverse social layers in the consciousness of being a cosmopolitan. Supranational media’s output is based on notions like science, rights and freedoms, the earth, coexistence, and "humanity”.

scholarly journals Design of Adaptive Compression Algorithm Elias Delta Code and Huffman

2018 ◽  
Author(s):  
Andysah Putera Utama Siahaan
Keyword(s):  
Data Compression ◽  
Binary Tree ◽  
Research Data ◽  
Input String ◽  
Binary Trees ◽  
Text File ◽  
Compression Process ◽  
Storage Media ◽  
Huffman Algorithm ◽  
Adaptive Compression

Compression aims to reduce data before storing or moving it into storage media. Huffman and Elias Delta Code are two algorithms used for the compression process in this research. Data compression with both algorithms is used to compress text files. These two algorithms have the same way of working. It starts by sorting characters based on their frequency, binary tree formation and ends with code formation. In the Huffman algorithm, binary trees are formed from leaves to roots and are called tree-forming from the bottom up. In contrast, the Elias Delta Code method has a different technique. Text file compression is done by reading the input string in a text file and encoding the string using both algorithms. The compression results state that the Huffman algorithm is better overall than Elias Delta Code.

KEEFEKTIFAN MEDIA KOMUNIKASI VISUAL SEBAGAI PENUNJANG PROMOSI PADA PERGURUAN TINGGI RAHARJA

CCIT Journal ◽  
2015 ◽  
Vol 9 (1) ◽  
pp. 77-86
Author(s):  
Lusyani Sunarya ◽  
Po Abas Sunarya ◽  
Jasmine Dara Assyifa
Keyword(s):  
Visual Communication ◽  
Communication Media ◽  
Media Campaign ◽  
Prospective Students ◽  
Media Campaigns ◽  
Great Opportunity ◽  
Information And Communication ◽  
The Media ◽  
Fierce Competition ◽  
The University

The development of visual communication media at this time is very helpful in supporting information and communication. But often presented visual communication  media  are  less  effective  and appropriate. While so many universities in Indonesia, the increasingly fierce competition in attracting new students. Media Visual Communication can be applied to college in introducing or raising the image and popularity or promote and provide information to prospective students. In essence, in this case the effectiveness of media campaigns assessed in spreading information, influence or persuade prospective students and new student to join the university. The method used by the questionnaires to assess the effectiveness of implemented that have been implemented such as  brochures,  banners, posters, billboards, catalogs, paper bag,  flyers  and  merchandise.  In  conclusion,  this  article specifically assess visual communication media from case studies in Perguruan Tinggi Raharja considered effective and consistent contribution.. This study found a great opportunity to improve the promotion of additional digital marketing media campaign called the college through the  stages resulting in some visual communication media that can be received by the target audience. To create a media campaign needs planning in accordance with the background of the problem so that the media are made to overcome the problems encountered

THE INCREASING OF DATA TRANSFER NOISE IMMUNITY IN DEPARTMENTAL COMMUNICATION SYSTEMS OF SHORT-WAVE RANGE

2018 ◽  
pp. 7-19
Author(s):  
B. G. Shadrin ◽  
◽  
D. E. Zachateyskiy ◽  
V. A. Dvoryanchikov Dvoryanchikov ◽  
◽  
...  
Keyword(s):  
Communication Systems ◽  
Noise Immunity ◽  
Data Transfer ◽  
Short Wave ◽  
Wave Range

Text Encryption based on Huffman Coding and ElGamal Cryptosystem

2020 ◽  
Vol 14 ◽  
Author(s):  
Khoirom Motilal Singh ◽  
Laiphrakpam Dolendro Singh ◽  
Themrichon Tuithung
Keyword(s):  
Data Transfer ◽  
Huffman Coding ◽  
Large Integer ◽  
Text Data ◽  
Storage Devices ◽  
Scientific World ◽  
Elgamal Cryptosystem ◽  
Encryption Schemes ◽  
Transfer Operation ◽  
And Performance

Background: Data which are in the form of text, audio, image and video are used everywhere in our modern scientific world. These data are stored in physical storage, cloud storage and other storage devices. Some of it are very sensitive and requires efficient security while storing as well as in transmitting from the sender to the receiver. Objective: With the increase in data transfer operation, enough space is also required to store these data. Many researchers have been working to develop different encryption schemes, yet there exist many limitations in their works. There is always a need for encryption schemes with smaller cipher data, faster execution time and low computation cost. Methods: A text encryption based on Huffman coding and ElGamal cryptosystem is proposed. Initially, the text data is converted to its corresponding binary bits using Huffman coding. Next, the binary bits are grouped and again converted into large integer values which will be used as the input for the ElGamal cryptosystem. Results: Encryption and Decryption are successfully performed where the data size is reduced using Huffman coding and advance security with the smaller key size is provided by the ElGamal cryptosystem. Conclusion: Simulation results and performance analysis specifies that our encryption algorithm is better than the existing algorithms under consideration.

Sign in / Sign up

Export Citation Format

Share Document