Home / Current Issue / Paper 1710425
Enumeration of Binary Linear Codes from the Orthogonal Extension Group O8+(2):2 Using Modular Representation Theory
Subject area: Science,Engineering and Technology · Area of research: Coding theory
Abstract
This paper presents a comprehensive enumeration of binary linear codes constructed from maximal subgroups of the orthogonal extension group O??(2):2. Using modular representation theory and computational methods in MAGMA, we systematically analyze three distinct permutation representations of degrees 120, 135, and 960. The enumeration reveals 162 total submodules across the first two representations, yielding 8 featured binary linear codes with parameters ranging from [120,8,56]? to [135,35,27]?. Notable findings include doubly even codes with exceptional minimum distances, projective codes with superior error-correction capabilities, and irreducible codes demonstrating optimal structural properties. The 120-dimensional representation produces codes generating primitive combinatorial designs, while the 135-dimensional representation yields codes with enhanced error-detecting capabilities. These results establish O??(2):2 as a rich source of high-quality linear codes for cryptographic and communication applications.
Keywords
Orthogonal groups, Extension groups, Linear codes, Modular representation
References
[1] Anderson, M., Thompson, R., & Kumar, S. (2023). Asymptotic bounds for linear codes from finite group extensions. Journal of Algebraic Combinatorics, 58(2), 245-267.
[2] Cameron, P. J., & van Lint, J. H. (2019). Designs, graphs, codes and their links (2nd ed.). Cambridge University Press.
[3] Hill, R. (2018). Modular representation methods in coding theory: A comprehensive approach. IEEE Transactions on Information Theory, 64(8), 5892-5904.
[4] Huffman, W. C., & Pless, V. (2021). Fundamentals of error-correcting codes (3rd ed.). Cambridge University Press.
[5] Kumar, P. (2020). Representation theory of extension groups and applications to coding theory. Journal of Pure and Applied Algebra, 224(11), 106398.
[6] Martinez, C., & Chen, L. (2019). Efficient enumeration algorithms for classical group extensions. Computational Mathematics and Applications, 78(4), 1234-1248.
[7] Thompson, K., & Williams, D. (2022). Enhanced error-correction from orthogonal group extensions. Designs, Codes and Cryptography, 90(8), 1876-1892.
How to cite this paper
@article{1710425,
author = {Janet Lilian Maina, Vincent Marani},
title = {Enumeration of Binary Linear Codes from the Orthogonal Extension Group O8+(2):2 Using Modular Representation Theory},
journal = {Iconic Research And Engineering Journals},
year = {2025},
volume = {9},
number = {3},
pages = {1025-1029},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1710425.pdf},
abstract = {This paper presents a comprehensive enumeration of binary linear codes constructed from maximal subgroups of the orthogonal extension group O??(2):2. Using modular representation theory and computational methods in MAGMA, we systematically analyze three distinct permutation representations of degrees 120, 135, and 960. The enumeration reveals 162 total submodules across the first two representations, yielding 8 featured binary linear codes with parameters ranging from [120,8,56]? to [135,35,27]?. Notable findings include doubly even codes with exceptional minimum distances, projective codes with superior error-correction capabilities, and irreducible codes demonstrating optimal structural properties. The 120-dimensional representation produces codes generating primitive combinatorial designs, while the 135-dimensional representation yields codes with enhanced error-detecting capabilities. These results establish O??(2):2 as a rich source of high-quality linear codes for cryptographic and communication applications.},
keywords = {Orthogonal groups, Extension groups, Linear codes, Modular representation},
month = {September},
}