Abstract
AbstractWe 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.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference37 articles.
1. Adhikari MR, Adhikari A (2014) Basic modern algebra with applications. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1599-8
2. Alon N, Lubetzky E (2006) The Shannon capacity of a graph and the independence numbers of its powers. IEEE Trans Inf Theory 52(5):2172–2176. https://doi.org/10.1109/TIT.2006.872856
3. Barrus MD (2012) Havel–Hakimi residues of unigraphs. Inf Process Lett 112(1–2):44–48. https://doi.org/10.1016/j.ipl.2011.10.011
4. Baumert LD, McEliece RJ, Rodemich E, Rumsey HC Jr, Stanley R, Taylor H (1971) A combinatorial packing problem. In: Computers in algebra and number theory (Proc SIAM-AMS Sympos Appl Math, New York, 1970). American Mathematical Society, Providence, RI, pp 97–108. SIAM–AMS Proc., Vol. IV
5. Boche H, Deppe C (2020) Computability of the zero-error capacity of noisy channels. arXiv: 2010.06873