Application-Oriented Study of Next-Generation Alternant Codes over Gaussian Integers for Secure and Efficient Communication

This paper presents the construction and analysis of a novel class of alternant codes over Gaussian integers, aimed at enhancing error correction capabilities in high-reliability communication systems. These codes are constructed using parity-check matrices derived from finite commutative local rings with unity, specifically Zn[i], where i2=−1. A detailed algebraic investigation of the polynomial xn−1 over these rings is conducted to facilitate the systematic construction of such codes. The proposed alternant codes extend the principles of classical BCH and Goppa codes to complex integer domains, enabling richer algebraic structures and greater error-correction potential. We evaluate the performance of these codes in terms of error correction capability, and redundancy. Numerical results show that the proposed codes outperform classical short-length codes in scenarios requiring moderate block lengths, such as those applicable in certain segments of 5G and IoT networks. Unlike conventional codes, these constructions allow enhanced structural flexibility that can be tuned for various application-specific parameters. While the potential relevance to quantum-safe communication is acknowledged, it is not the primary focus of this study. This work demonstrates how extending classical coding techniques into non-traditional algebraic domains opens up new directions for designing robust and efficient communication codes.