2000 character limit reached
Linear Codes from Incidence Matrices of Unit Graphs
Published 9 Nov 2020 in cs.IT and math.IT | (2011.04914v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.