On prefix codes satisfying RLL-constraint for Zipf distribution
The study of Information Theory has been ubiquitously applied to many fields in the digital world, with significant focus in transmitting data through channels as efficiently as possible. Therein lies the Optimal Coding Problem; where symbols of varying probabilities of occurring in the source text...
Saved in:
Main Author: | Ho, Shaun |
---|---|
Other Authors: | Kiah Han Mao |
Format: | Thesis-Master by Research |
Language: | English |
Published: |
Nanyang Technological University
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/143338 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Constructing constrained prefix-free codes
by: Ng, Kai Xiang
Published: (2020) -
Optimal prefix codes and huffman codes
by: Long, D., et al.
Published: (2013) -
Satisfying real-time constraints with custom instructions
by: Yu, P., et al.
Published: (2013) -
Permutable entire functions satisfying algebraic differential equations
by: Jian Hua Zheng, et al.
Published: (2018) -
Permutable entire functions satisfying algebraic differential equations
by: Jian Hua Zheng, et al.
Published: (2018)