Forcing linearity on greedy codes

DOI10.1023/A:1027385806430MaRDI QIDQ1924168zbMATH OpenFDO

Authors Jeffrey T. Bonn

Publication date 19 June 1997

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

zbMATH Keywords

greedy codesB-greedy codestriangular greedy codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Recommendations

• Publication:4886133
• A note on greedy codes
• scientific article; zbMATH DE number 1504658
• On greedy algorithms in coding theory
• On the extendability of linear codes
• On linear rigidity of a class of codes
• scientific article; zbMATH DE number 3861051
• On the non-existence of linear codes attaining the Griesmer bound
• On the maximality of linear codes
• scientific article; zbMATH DE number 5054194

Cited in

(5)

• Graded cyclic order and greedy codes
• On the second greedy weight for linear codes satisfying the fullrank condition
• On the construction of linear \(q\)-ary lexicodes.
• Greedy codes
• Lexicodes over rings

This page was built for publication: Forcing linearity on greedy codes

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