Improving the Gilbert–Varshamov Bound for<tex>q</tex>-Ary Codes

DOI10.1109/TIT.2005.853300MaRDI QIDQ3547645zbMATH OpenOpenAlexFDO

Authors Van Vu, Lei Wu

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2005.853300

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• Improving the Gilbert-Varshamov bound for q-ary codes
• Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
• Sharpening the Gilbert-Varshamov bound in the finite case
• Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
• Strengthening the Gilbert-Varshamov bound

Cited in

(11)

• Efficient q-ary immutable codes
• Slight improvements of the Singleton bound
• Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
• Sharpening the Gilbert-Varshamov bound in the finite case
• Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
• Improving the Gilbert-Varshamov bound for q-ary codes
• Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
• An improvement of the Gilbert bound for constant weight codes (Corresp.)
• scientific article; zbMATH DE number 3793939 (Why is no real title available?)
• Singleton-type bounds for list-decoding and list-recovery, and related results
• Codes for adversaries: between worst-case and average-case jamming

This page was built for publication: Improving the Gilbert–Varshamov Bound for<tex>$q$</tex>-Ary Codes

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