Constructing constrained prefix-free codes

Constructing constrained prefix-free codes

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...

Full description

Saved in:
Bibliographic Details
Main Author: Ng, Kai Xiang
Other Authors: Kiah Han Mao
Format: Final Year Project
Language:English
Published: Nanyang Technological University 2020
Subjects:
Science::Mathematics
Engineering::Computer science and engineering::Data::Coding and information theory
Online Access:https://hdl.handle.net/10356/139510
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary: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.

Similar Items