AI Chat AI Image Generator AI Video Text to Speech

Linear Codes from Incidence Matrices of Unit Graphs

11/09/2020

∙

by N. Annamalai, et al.

∙

∙

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.

N. Annamalai
6 publications
C. Durairajan
4 publications

page 1

page 2

page 3

page 4

research

∙ 11/03/2020

Codes from the Incidence Matrices of a zero-divisor Graphs

In this paper, we examine the linear codes with respect to the Hamming m...

0 N. Annamalai, et al. ∙

research

∙ 12/22/2019

Johnson Graph Codes

We define a Johnson graph code as a subspace of labelings of the vertice...

0 Iwan Duursma, et al. ∙

research

∙ 08/26/2022

Ortho-unit polygons can be guarded with at most ⌊n-4/8⌋ guards

An orthogonal polygon is called an ortho-unit polygon if its vertices ha...

0 J. M. Díaz-Báñez, et al. ∙

research

∙ 04/03/2021

Improving the Gilbert-Varshamov Bound by Graph Spectral Method

We improve Gilbert-Varshamov bound by graph spectral method. Gilbert gra...

0 Zicheng Ye, et al. ∙

research

∙ 07/12/2019

Resolvability of Hamming Graphs

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

0 Lucas Laird, et al. ∙

research

∙ 12/23/2022

Storage codes on coset graphs with asymptotically unit rate

A storage code on a graph G is a set of assignments of symbols to the ve...

0 Alexander Barg, et al. ∙

research

∙ 10/05/2021

High-rate storage codes on triangle-free graphs

Consider an assignment of bits to the vertices of a connected graph G(V,...

0 Alexander Barg, et al. ∙