Codes from the Incidence Matrices of a zero-divisor Graphs

11/03/2020
by   N. Annamalai, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2020

Linear Codes from Incidence Matrices of Unit Graphs

In this paper, we examine the binary linear codes with respect to Hammin...
research
05/27/2021

Two New Zero-Dimensional Qubit Codes from Bordered Metacirculant Construction

We construct qubit stabilizer codes with parameters [[81, 0, 20]] and [[...
research
06/30/2020

Zero-divisors of content algebras

In this article, we prove that in content extensions minimal primes exte...
research
09/01/2020

Reconfiguration graphs of zero forcing sets

This paper begins the study of reconfiguration of zero forcing sets, and...
research
08/11/2022

On Zero-Divisor Graph of the ring 𝔽_p+u𝔽_p+u^2 𝔽_p

In this article, we discussed the zero-divisor graph of a commutative ri...
research
06/30/2020

Zero-divisor graphs of nilpotent-free semigroups

We find strong relationships between the zero-divisor graphs of apparent...
research
07/12/2019

Resolvability of Hamming Graphs

A subset of vertices in a graph is called resolving when the geodesic di...

Please sign up or login with your details

Forgot password? Click here to reset