Compressed DNA Coding Using Minimum Variance Huffman Tree

被引：19

作者：

Mishra, Pooja ^{[1
]}

Bhaya, Chiranjeev ^{[1
]}

Pal, Arup Kumar ^{[1
]}

Singh, Abhay Kumar ^{[2
]}

机构：

[1] Indian Sch Mines, Indian Inst Technol, Dept Comp Sci & Engn, Dhanbad 826004, Bihar, India

[2] Indian Sch Mines, Indian Inst Technol, Dept Math & Comp, Dhanbad 826004, Bihar, India

来源：

IEEE COMMUNICATIONS LETTERS | 2020年 / 24卷 / 08期

关键词：

Compression; data storage; DNA; Huffman coding; DIGITAL INFORMATION; STORAGE; CODES;

D O I：

10.1109/LCOMM.2020.2991461

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

DNA data storage is a highly emerging technology of storing large amount of data in a small volume for a long period of time. However, synthesis of DNA sequences come with a cost that depends on the number of nucleotides present in it. An efficient algorithm to store large amount of data in small number of nucleotides has been proposed which uses minimum-variance Huffman coding. The DNA sequences generated follow GC-constraint and run-length constraint of at most 1. Texts have been stored in lossless manner. Images have been stored in both lossless and lossy manner. In either of the cases, a high code-rate has been attained, thus implying good compression and reduction in cost of synthesis.

引用

页码：1602 / 1606

页数：5

共 50 条

[21] Adaptive Spatial Modulation Using Huffman Coding
Wang, Wei
Zhang, Wei
2016 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2016,
[22] An Implementation of Steganography Using Construction of Huffman Tree
Hiroshi, Yamamoto
Hayato, Fujioka
2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012), 2012, : 634 - 637
[23] Medical Image Compression Using Wavelet-Based Fractal Quad Tree Combined with Huffman Coding
Kadam, Sandhya
Rathod, Vijay R.
THIRD INTERNATIONAL CONGRESS ON INFORMATION AND COMMUNICATION TECHNOLOGY, 2019, 797 : 929 - 936
[24] Fingerprint Patterns Recognition System Using Huffman Coding
Aburas, Abdurazzag Ali
Rehiel, Salem Ali
WORLD CONGRESS ON ENGINEERING 2008, VOL III, 2008, : 1794 - 1796
[25] Lossless EEG Compression Using the DCT and the Huffman Coding
Karimu, R. Y.
Azadi, S.
JOURNAL OF SCIENTIFIC & INDUSTRIAL RESEARCH, 2016, 75 (10): : 615 - 620
[26] CLASS-DEPENDENT AND DIFFERENTIAL HUFFMAN CODING OF COMPRESSED FEATURE PARAMETERS FOR DISTRIBUTED SPEECH RECOGNITION
Lee, Young Han
Kim, Deok Su
Kim, Hong Kook
2009 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS 1- 8, PROCEEDINGS, 2009, : 4165 - 4168
[27] Entropy of Malayalam Language and Text Compression Using Huffman Coding
Kuruvila, Melbin
Gopinath, Deepa P.
2014 First International Conference on Computational Systems and Communications (ICCSC), 2014, : 150 - 155
[28] An Improved Image Compression Technique Using Huffman Coding and FFT
Patel, Rachit
Katiyar, Sapna
Arora, Khushboo
SMART TRENDS IN INFORMATION TECHNOLOGY AND COMPUTER COMMUNICATIONS, SMARTCOM 2016, 2016, 628 : 54 - 61
[29] A Fast and Improved Image Compression Technique Using Huffman Coding
Patel, Rachit
Kumar, Virendra
Tyagi, Vaibhav
Asthana, Vishal
PROCEEDINGS OF THE 2016 IEEE INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, SIGNAL PROCESSING AND NETWORKING (WISPNET), 2016, : 2283 - 2286
[30] Coding unconstrained FCB excitation using combinatorial and Huffman codes
Mittal, U
Ashley, JP
Cruz-Zeno, EM
2002 IEEE SPEECH CODING WORKSHOP PROCEEDINGS: A PARADIGM SHIFT TOWARD NEW CODING FUNCTIONS FOR THE BROADBAND AGE, 2002, : 129 - 131

← 1 2 3 4 5 →