Repozytorium publikacji - Politechnika Gdańska

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.

Autorzy

• dr Marcin Jurkiewicz link otwiera się w nowej karcie