Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/156922
 Title: Asymptotic improvement of GV bound Authors: Yip, Jose Zheng Ho Keywords: Science::Mathematics::Discrete mathematics Issue Date: 2022 Publisher: Nanyang Technological University Source: Yip, J. Z. H. (2022). Asymptotic improvement of GV bound. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/156922 Abstract: 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 also show that for the RLL(0,1) constrained system, we can achieve rates $2\log \phi - \log \tau$, where $\tau$ is the asymptotic of the total ball size for the RLL(0,1) constrained system URI: https://hdl.handle.net/10356/156922 Fulltext Permission: restricted Fulltext Availability: With Fulltext Appears in Collections: SPMS Student Reports (FYP/IA/PA/PI)

###### Files in This Item:
File Description SizeFormat
U1840437B_FYP_Thesis.pdf
Restricted Access

#### Page view(s)

29
Updated on May 27, 2022