Improving the Gilbert-Varshamov bound for q-ary codes

zbMATH Open1192.94140MaRDI QIDQ3576705FDOQ3576705

Authors: Van Vu, Lei Wu 

Publication date: 30 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0156/0.html

Recommendations

• Improving the Gilbert–Varshamov Bound for<tex>$q$</tex>-Ary Codes
• Sharpening the Gilbert-Varshamov bound in the finite case
• Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
• Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
• scientific article; zbMATH DE number 774615

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65)

Cited In (15)

• Improving the Gilbert–Varshamov Bound for<tex>$q$</tex>-Ary Codes
• A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm
• Slight improvements of the Singleton bound
• Sharpening the Gilbert-Varshamov bound in the finite case
• Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
• An improvement of the Gilbert bound for constant weight codes (Corresp.)
• Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
• Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
• Efficient \(q\)-ary immutable codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Better Gap-Hamming Lower Bounds via Better Round Elimination
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes

This page was built for publication: Improving the Gilbert-Varshamov bound for \(q\)-ary codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576705)