What question did this study set out to answer?

The aim is to explore the linear codes generated from the incidence matrices of $(n, k)$-arrangement graphs and folded $n$-cube graphs.

April 1, 2026

Codes from incidence matrices of (n, k) -arrangement graph for n = 2k and folded n-cube graph

Key Points

The aim is to explore the linear codes generated from the incidence matrices of $(n, k)$-arrangement graphs and folded $n$-cube graphs.
Analyzed incidence matrices of $(n, k)$-arrangement graphs for $n = 2k$
Examined folded $n$-cube graph incidence matrices
Identified and discussed main parameters of the resulting codes
Described key parameters of linear codes from arrangement graphs
Presented linear codes parameters from folded $n$-cube graphs
Demonstrated the relationship between parameters and graph structures

Abstract

We examine the Formula: see text-ary linear codes from incidence matrix of the Formula: see text-arrangement graphs for Formula: see text The main parameters of the code is Formula: see text Also We examine the linear codes from incidence matrix of folded Formula: see text-cube graph. We also discuss the main parameters of the codes from incidence matrix of the above graphs.

Bookmark

Codes from incidence matrices of (n, k) -arrangement graph for n = 2k and folded n-cube graph

Key Points

Abstract

Cite This Study

Also Consider

Also Consider