<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel rdf:about="http://ir.library.sust.edu:8080/xmlui/handle/123456789/28">
<title>PhD</title>
<link>http://ir.library.sust.edu:8080/xmlui/handle/123456789/28</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://ir.library.sust.edu:8080/xmlui/handle/sust/227"/>
</rdf:Seq>
</items>
<dc:date>2026-05-08T04:27:20Z</dc:date>
</channel>
<item rdf:about="http://ir.library.sust.edu:8080/xmlui/handle/sust/227">
<title>DICTIONARY- BASED TEXT COMPRESSION TECHNIQUE  USING QUATERNARY CODE</title>
<link>http://ir.library.sust.edu:8080/xmlui/handle/sust/227</link>
<description>DICTIONARY- BASED TEXT COMPRESSION TECHNIQUE  USING QUATERNARY CODE
Habib, Ahsan
Improving  encoding  and  decoding  time  in  compression  technique  is  a  great &#13;
demand to modern users.  In  bit level compression  technique, it  requires more &#13;
time  to  encode  or  decode  every  single  bit  when  a  binary  code  is  used.  The &#13;
existing  Huffman  based algorithms  use  binary  code  which  slow  the  decoding &#13;
speed. This research proposes a new compression algorithm that makes use of a &#13;
variation  of  the  classic  Huffman  coding:  quaternary  Huffman  coding.  Using &#13;
quaternary  Huffman  coding,  each  symbol  is  encoded  into  a  quaternary  code &#13;
stream, instead of a binary bit stream. A quaternary code stream for Huffman &#13;
coding requires a shorter Huffman tree, i.e., less depth. The potential benefit of &#13;
a shorter Huffman tree is less traverse time, which improves both compression &#13;
and  decompression  throughput.  In  this  research,  we  analyze  the  properties  of &#13;
quaternary Huffman tree and conclude that a quaternary Huffman tree is usually &#13;
one-third of the height from a binary tree.  &#13;
In  this  research,  we  develop  a  dictionary-based  compression  technique where &#13;
we  use  a  quaternary  tree  instead  of  a  binary  tree  for  construction  of  Human &#13;
codes.  Firstly,  we  explore  the  properties  of  quaternary  tree  structure &#13;
mathematically for construction of Human codes. We study the terminology of &#13;
new tree structure thoroughly and prove the results. Secondly, after a statistical &#13;
analysis of English language; we design a variable length dictionary based on &#13;
quaternary  codes.  Thirdly,  we  develop  the  encoding  and  decoding  algorithms &#13;
for  the  proposed  technique.  We  compare  the  performance  of  the  proposed &#13;
technique  with  the  existing  popular  techniques.  The  proposed  technique &#13;
performs  better  than  the  existing  techniques  with  respect  to  decompression &#13;
speed while the space requirement increases insignificantly.
A dissertation submitted to the Department of Computer Science and Engineering of Shahjalal University of Science and &#13;
Technology in partial fulfillment of the requirements for the degree of Doctor of Philosophy
</description>
<dc:date>2019-07-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
