Research of Subnetting Based on Huffman Coding

Li, Ranran; Zhao, Yong; Xu, Qing; Qi, Xiaolin

doi:10.1007/978-3-030-00018-9_53

Cited by 1 publication

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Huffman algorithm works using the tree data structure to generate an optimal binary tree called Huffman tree to acquire encoding form. [17,18] The technical working of this algorithm uses a lower number of bits to encode the input data that exist more frequently. [19] Practically, Huffman considers an easy-touse algorithm because of its simpler mathematical computation to obtain the several parameters.…”

Section: Huffman Codementioning

confidence: 99%

A New Scheme for Removing Duplicate Files from Smart Mobile Devices

Asaad

Alamri

2019

Cihan U Erbil SCI J

View full text Add to dashboard Cite

The continuous development of the information technology and mobile communication world and the potentials available in the smart devices make these devices widely used in daily life. The mobile applications with the internet are distinguished simple, essay to use in any time/anywhere, communication between relatives and friends in different places in the world. The social application networks make these devices received several of the duplicate files daily which lead to many drawbacks such inefficient use of storage, low performance of CPU, RAM, and increasing consumption battery. In this paper, we present a good scheme to remove from the duplicate files, and we focus on image files as a common case in social apps. Our work overcomes on the above-mentioned issues and focuses to use hash function and Huffman code to build unique code for each image. Our experiments improve the performance from 1046770, 1995808 ns to 950000, and 1981154 ns in Galaxy and HUAWEI, respectively. In the storage side, the proposed scheme saves storage space from 1.9 GB, 1.24 GB to 2 GB, and 1.54 GB, respectively.

show abstract

Section: Huffman Codementioning

confidence: 99%