Average width of balanced codewords
The problem that this project aims to solve is to find the average width of all the balancing indices for balanced codewords of length N. Based on Knuth’s construction of balanced codewords, a balanced codeword is simply obtained after a simple modification and also having a prefix added to it, in o...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
Nanyang Technological University
2021
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/148437 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | The problem that this project aims to solve is to find the average width of all the balancing indices for balanced codewords of length N. Based on Knuth’s construction of balanced codewords, a balanced codeword is simply obtained after a simple modification and also having a prefix added to it, in order to uniquely identify it (Knuth, 1986). Immink and Weber then introduce a method that is much more efficient and also minimizes redundancy. Therefore, the aim is to find a closed solution for the average width of the balancing indices based on Immink and Weber’s method of constructing balanced codewords since the width of a balanced codeword actually counts the number of balancing indices for it. (Kees A. Schouhamer Immink, 2010). |
|---|