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: | Song, Qiumin |
---|---|
Other Authors: | Kiah Han Mao |
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 |
Similar Items
-
On the minimum pseudo-codewords of LDPC codes
by: Xia, S.-T., et al.
Published: (2014) -
Action recognition based on correlated codewords of body movements
by: Worapan Kusakunniran, et al.
Published: (2018) -
The maximum number of minimal codewords in long codes
by: Alahmadi, A., et al.
Published: (2013) -
The maximum number of minimal codewords in an [n,k]-code
by: Alahmadi, A., et al.
Published: (2013) -
Experimental implementation of a codeword-stabilized quantum code
by: Zhang, J., et al.
Published: (2014)