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