[1] P. Dankelmann, J. D. Key, B. G. Rodrigues, Codes from Incidence Matrices of Graphs, Univ. KwaZulu-Natal, Durban, 2011.
[2] C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, R. L. Urbanke, Finite-length analysis of low-density parity-check codes on the binary erasure channel, IEEE Trans. Inf. Theory 48 (2002) 1570–1579.
[3] M. Esmaeili, A. Zaghian, On the combinatorial structure of a class of [(m,2),(m−1,2), 3] shortened Hamming codes and their dual codes, Discrete Appl. Math. 157 (2009) 356–363.
[4] R. G. Gallager, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.
[5] M. Nazari, H. R. Maimani, Stopping sets of codes from complete graph, J. Discrete Math. Sci. Cryptogr. 25 (2022) 1–10.
[6] P. Solé, T. Zaslavsky, The covering radius of the cycle code of a graph, Discrete Appl. Math. 45 (1993) 63–70.
[7] R. M. Tanner, A recursive approach to low complexity codes, IEEE Trans. Inf. Theory 27 (1981) 533–547.
[8] A. Tucker, Applied Combinatorics, 4th ed., John Wiley & Sons, New York, 2002.
[9] A. Velasquez, K. Subramani, P. Wojciechowski, On the complexity of and solutions to the minimum stopping and trapping set problems, Theoretical Computer Science 915 (2022) 26–44.
)
)