Linear Codes from Incidence Matrices of Unit Graphs

2020/11/09 by N. Annamalai, Annamalai, N., C. Durairajan +1
Computer Science · Engineering · #05C38 #05C50 #94B05 #Coding theory and cryptography #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2011.04914

openalex publication_date 2020/11/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we examine the binary linear codes with respect to Hamming metric from incidence matrix of a unit graph G(ℤ_n) with vertex set is ℤ_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.

Citations

• Coloring of commutative rings

Related

• Codes from the Incidence Matrices of a zero-divisor Graphs
• Construction of Linear Codes from the Unit Graph G(ℤ_n)
• Construction of Linear Codes from the Unit Graph G(ℤ_n⊕ ℤ_m)
• Linear Codes Derived from the Structure of Unit Graphs Over ℤ_n
• Isodual and Self-dual Codes from Graphs