Codes from the Incidence Matrices of a zero-divisor Graphs

2020/11/03 by Annamalai, N., Durairajan, C
#05C38 #05C50 #94B05 #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2011.01602

Abstract

In this paper, we examine the linear codes with respect to the Hamming metric from incidence matrices of the zero-divisor graphs with vertex set is the set of all non-zero zero-divisors of the ring ℤ_n and two distinct vertices being adjacent iff their product is zero over ℤ_n. The main parameters of the codes are obtained.

Related

• Linear Codes from Incidence Matrices of Unit Graphs
• Construction of Linear Codes from the Unit Graph G(ℤ_n)
• Codes from incidence matrices of hypergraphs
• Linear Codes Derived from the Structure of Unit Graphs Over ℤ_n
• Construction of Linear Codes from the Unit Graph G(ℤ_n⊕ ℤ_m)