Construction of linear codes from the unit graph G(ℤn).

Autor: Jain, Rupali S., Reddy, B. Surendranath, Shaikh, Wajid M.
Předmět:
Zdroj: Asian-European Journal of Mathematics; Nov2023, Vol. 16 Issue 11, p1-19, 19p
Abstrakt: In this paper, we consider the unit graph G (ℤ n) , where n = p 1 n 1  or  p 1 n 1 p 2 n 2  or  p 1 n 1 p 2 n 2 p 3 n 3 and p 1 , p 2 , p 3 are distinct primes. For any prime q , we construct q -ary linear codes from the incidence matrix of the unit graph G (ℤ n) with their parameters. We also prove that the dual of the constructed codes have minimum distance either three or four. Lastly, we stated two conjectures on diameter of unit graph G (ℤ n) and linear codes constructed from the incidence matrix of the unit graph G (ℤ n) for any integer n. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index