Linear Codes from Incidence Matrices of Unit Graphs

Abstract

In this paper, we examine the binary linear codes with respect to Hamming metric from incidence matrix of a unit graph $G({\mathbb{Z}}_n)$ with vertex set is ${\mathbb{Z}}_n$ and two distinct vertices $x$ and $y$ being adjacent if and only if $x+y$ is unit. The main parameters of the codes are given.

arXiv admin note: text overlap with arXiv:2011.01602

References in corpus (1)

• Codes from the Incidence Matrices of a zero-divisor Graphs