The neighbor graph of self-dual codes over the ring of integers modulo 4

Key Points

• The structure of the neighbor graph is critical for understanding self-dual codes, enhancing algebraic foundations.
• A detailed analysis shows the properties of these codes under the ring of integers modulo 4, providing new data points.
• Graph theory techniques were applied to explore the relationships in self-dual codes, uncovering connections among linear codes.
• This study highlights potential applications in coding theory and information systems, indicating new avenues for exploration.