Greedy codes
From MaRDI portal
Publication:690025
DOI10.1016/0097-3165(93)90085-MzbMATH Open0778.94006OpenAlexW2912221431MaRDI QIDQ690025FDOQ690025
Authors: Richard A. Brualdi, V. Pless 
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
Recommendations
- Publication:4863495
- Publication:4886133
- A note on greedy codes
- The greedy Gray code algorithm
- On greedy algorithms in coding theory
- Self-orthogonal greedy codes
- Graded cyclic order and greedy codes
- Forcing linearity on greedy codes
- scientific article; zbMATH DE number 969100
- On zero-error codes produced by greedy algorithms
Cites Work
Cited In (16)
- Title not available (Why is that?)
- Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless
- In memoriam. A tribute to Vera Pless (1931--2020)
- Naive configurations
- Graded cyclic order and greedy codes
- On zero-error codes produced by greedy algorithms
- Topics in Banach Space Theory
- Bounds on codes derived by counting components in Varshamov graphs
- On the construction of linear \(q\)-ary lexicodes.
- New bounds for linear codes of covering radii 2 and 3
- Lexicodes over finite principal ideal rings
- Partial permutation decoding for MacDonald codes
- Improved partial permutation decoding for Reed-Muller codes
- Lexicodes over rings
- Lexicographic codes: Error-correcting codes from game theory
- Title not available (Why is that?)
This page was built for publication: Greedy codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690025)
