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...
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 |
Similar Items
-
Constructing constrained prefix-free codes
by: Ng, Kai Xiang
Published: (2020) -
On the bridge between constraint satisfaction and Boolean satisfiability
by: Petke, J
Published: (2012) -
Bisplit graphs satisfy the Chen-Chv\'atal conjecture
by: Laurent Beaudou, et al.
Published: (2019-05-01) -
Zipf Distribution Power AllocationAapproach for NOMA Systems
by: Hanane Himeur, et al.
Published: (2023-09-01) -
Vulnerability Detection in Binary Code Based on Constraint Satisfiability Checking
by: A. V. Filonenko, et al.
Published: (2010-06-01)