Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
Work
Year: 2004
Type: article
Abstract: Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance d. We study the minimum asymptotic redundancy as n grows while q and d are fixed. For any d and q/spl ges/d-1, long algebr... more
Authors Sergey Yekhanin, Ilya Dumer
Cites: 20
Cited by: 25
Related to: 10
FWCI: 1.226
Citation percentile (by year/subfield): 92.91
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green