Bounds on codes derived by counting components in Varshamov graphs

DOI10.1007/s10623-005-6118-6zbMath1172.94648OpenAlexW3013182834MaRDI QIDQ2491316

Katie M. O'Brien, Patrick Fitzpatrick

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-005-6118-6

zbMATH Keywords

Varshamov boundGreedy codesVarshamov graph

Mathematics Subject Classification ID

Bounds on codes (94B65)

Uses Software

• Code Tables

Cites Work

• Unnamed Item
• Lexicographic order and linearity
• Greedy codes
• Strengthening the Gilbert-Varshamov bound
• Lexicographic codes: Error-correcting codes from game theory
• Lengthening and the Gilbert-Varshamov bound

This page was built for publication: Bounds on codes derived by counting components in Varshamov graphs