Codes from incidence matrices of (n,k)-arrangement graph for n = 2k and folded n-cube graph
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
In this paper, 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.
Fields of Study & Subjects
Coding theory and cryptography
Finite Group Theory Research
Advanced Combinatorial Mathematics
Publication details
- Journal / source
- Discrete Mathematics Algorithms and Applications
- Publication date
- 30 March 2026
- Language
- EN