Greedy codes
From MaRDI portal
Publication:690025
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
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
This page was built for publication: Greedy codes