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.

中文翻译：

---

贪婪算法产生的零错误码

我们提出了两种确定零错误代码和零错误容量下界的贪婪算法。这些算法有很多优点，例如，它们不会将整个产品图存储在计算机内存中，并且它们使用所有维度的所谓分布来获得更好的零误差容量近似值。我们还展示了我们算法的其他应用。