Loading...
Please wait, while we are loading the content...
Similar Documents
Asymptotic improvement of the gilbert-varshamov bound for linear codes (2006).
| Content Provider | CiteSeerX |
|---|---|
| Author | Gaborit, Philippe Zémor, Gilles |
| Description | This content is published in ISIT 2006 |
| Abstract | The Gilbert-Varshamov bound states that the maximum size A2(n, d) of a binary code of length n and minimum distance d satisfies A2(n, d) ≥ 2n /V (n, d −1) where V (n, d) = ∑d n i=0 i stands for the volume of a Hamming ball of radius d. Recently Jiang and Vardy showed that for binary non-linear codes this bound can be improved to 2 A2(n, d) ≥ cn |
| File Format | |
| Publisher Date | 2006-01-01 |
| Access Restriction | Open |
| Subject Keyword | Gilbert-varshamov Bound Asymptotic Improvement Linear Code Maximum Size A2 Minimum Distance Satisfies A2 Binary Non-linear Code Binary Code Recently Jiang Hamming Ball |
| Content Type | Text |
| Resource Type | Conference Proceedings |
