Asymptotic improvement of GV bound

• Main Author: Yip, Jose Zheng Ho
• Other Authors: Kiah Han Mao
• Format: Final Year Project
• Language: English
• Published: Nanyang Technological University 2022
• Subjects: Science::Mathematics::Discrete mathematics
• Online Access: https://hdl.handle.net/10356/156922
• Institution: Nanyang Technological University

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...