Asymptotic improvement of GV bound
The Gilbert-Varshamov (GV) bound is a well-known lower bound in coding theory that claims that for any given code with relative distance $\delta$, there is a lower bound for the rates possible. This paper will asymptotically improve upon by 1.5$\frac{\log n}{n}$ for unconstrained binary systems. We...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2022
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/156922 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|