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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
Nanyang Technological University
2020
|
| Subjects: | |
| 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 |