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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
Nanyang Technological University
2021
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/148437 |