We present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.
Authors
Additional information
- DOI
- Digital Object Identifier link open in new tab 10.1007/s10878-021-00825-y
- Category
- Publikacja w czasopiśmie
- Type
- artykuły w czasopismach
- Language
- angielski
- Publication year
- 2022
Source: MOSTWiedzy.pl - publication "On zero-error codes produced by greedy algorithms" link open in new tab
