Greedy codes

DOI10.1016/0097-3165(93)90085-MzbMath0778.94006OpenAlexW2912221431MaRDI QIDQ690025

Vera S. Pless, Richard A. Brualdi

Publication date: 2 December 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(93)90085-m

zbMATH Keywords

greedy algorithmminimum distanceparity check matrixgreedy codeslexicodesordered bases

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Related Items (10)

In memoriam. A tribute to Vera Pless (1931--2020) ⋮ Partial permutation decoding for MacDonald codes ⋮ Improved partial permutation decoding for Reed-Muller codes ⋮ Naive configurations ⋮ Lexicodes over rings ⋮ Bounds on codes derived by counting components in Varshamov graphs ⋮ Lexicodes over finite principal ideal rings ⋮ New bounds for linear codes of covering radii 2 and 3 ⋮ On the construction of linear \(q\)-ary lexicodes. ⋮ Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless

Cites Work

• Integral lexicographic codes
• Lexicographic codes: Error-correcting codes from game theory
• An updated table of minimum-distance bounds for binary linear codes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Greedy codes