Please use this identifier to cite or link to this item:
Title: Constructing constrained prefix-free codes
Authors: Ng, Kai Xiang
Keywords: Science::Mathematics
Engineering::Computer science and engineering::Data::Coding and information theory
Issue Date: 2020
Publisher: Nanyang Technological University
Abstract: The Optimal Coding problem is a well-known problem in information theory. The aim is for two parties to transmit information to each other through channels as efficiently as possible. In this Final Year Project, we construct prefi x-free code under runlength-limited (RLL) constraints. We apply this constraint on the well-known Huffman codes, as well as construct other versions of these constraint codes, based on Horibe, and compare the efficiency of both codes. We construct 2-RLL codes in two ways: Tribonacci trees with equal probabilities, and weight balancing technique with probabilities of a geometric distribution. Finally we compare the constructed codes against Huffman codes with constraint and concluded that Huffman codes with 2-RLL constraint are more efficient.
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
Ng_Kai_Xiang_U1640664B_FYP (Final).pdf
  Restricted Access
970.53 kBAdobe PDFView/Open

Page view(s)

Updated on May 25, 2022

Download(s) 50

Updated on May 25, 2022

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.