Characterization and existence conditions of codes meeting the Varshamov- Griesmer bound

zbMATH Open0675.94013MaRDI QIDQ1122555

V. N. Logachev

Publication date: 1988

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

binary linear codegenerator matrices of anticodesVarshamov-Griesmer bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (5)

New sufficient existence conditions for the codes that meet the Varshamov-Griesmer bound ⋮ Bounds on codes derived by counting components in Varshamov graphs ⋮ Characterization of two classes of codes that attain the Griesmer bound ⋮ The Meet Operation in the Imbalance Lattice of Maximal Instantaneous Codes: Alternative Proof of Existence ⋮ A characterization of certain Griesmer codes: MMD codes in a more general sense

This page was built for publication: Characterization and existence conditions of codes meeting the Varshamov- Griesmer bound

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