Home / Current Issue / Paper 1704922
Classification of Some Internal Structures of Degree 120 Related to a Group of Extension O_8^+ (2): 2
Subject area: Science,Engineering and Technology · Area of research: Pure Mathematics
Abstract
This paper uses the modular representation method to classify the internal structures of degree 120 related to a group of extension,O_8^+ (2): 2.Specifically, we determine the number of binary linear codes and construct their lattice structure, as well as investigate the properties of some linear codes and designs of minimum weights. Our findings reveal that there are 12 binary linear codes, consisting of 4 doubly even codes, 4 projective codes, 2 irreducible codes, and 2 decomposable codes. We also identify 2 primitive 1-designs of minimum weight. The results demonstrate the potential benefits of using linear codes and designs from finite groups of extension with modular representation methods, such as improved error correction, increased data storage capacity, improved security, efficient designs, and improved computational efficiency. However, it is important to note that this topic can be complex and technical, and we recommend that stakeholders collaborate with experts in the field to ensure the accuracy and reliability of the information being used. Overall, this study contributes to the understanding of the modular representation method and its applications in coding theory and related fields.
References
[1] Berlekamp, E. R. (2015).Algebraic coding theory(revised edition).WorldScientific.
[2] Peterson, W. W., Peterson, W., Weldon, E. J., and Weldon, E. J. (1972). Errorcorrecting codes. MIT press.
[3] Bierbrauer, J. (2016). Introduction to coding theory. CRC Press.
[4] Fletcher, C. R. (1984).Finite fieldsRudolf Lidl and Harald Niederreiter.Pp 755. 57 80. 1983. ISBN 0-201-13519-3 (Addison-Wesley). The Mathematical Gazette, 68(446), 306-307.
[5] Hankerson, D. C., Hoffman, G., Leonard, D. A., Lindner, C. C., Phelps, K. T., Rodger, C. A., and Wall, J. R. (2000). Coding theory and cryptography: the essentials. CRC Press.
[6] Richardson, T., and Urbanke, R. (2008). Modern coding theory. Cambridgeuniversity press.
[7] Baylis, D. J. (1997). Error Correcting Codes: A Mathematical Introduction (Vol.15). CRC Press.
[8] Bierbrauer, J. (2016). Introduction to coding theory. CRC Press.
[9] Ryan, W., and Lin, S. (2009). Channel codes: classical and modern. Cambridgeuniversity press.
[10] Davey, M. C., and MacKay, D. J. (1998). Low density parity check codes overGF (q). In 1998 Information Theory Workshop (Cat. No. 98EX131) (pp. 70-71).IEEE.
[11] Robinson, D. J. (1996). The Theory of Group Extensions. In A Course in theTheory of Groups (pp. 310-355). Springer, New York, NY.
[12] Chikamai, W. L. (2012). Linear codes obtained from 2-modular representations of some finite simple groups (Doctoral dissertation).
[13] Maina, J. L. (2019). 2-Modular Representations of Unitary Group U3 (4) AsLinear Codes (Masters Dissertation, Kibabii University.
[14] Marani, V.N (2019). Some Linear Codes, Graphs and Designs from MathieuGroups M24 and M23 (Doctoral dissertation, Kibabii University).
[15] Pham, D. M., Premkumar, A. B., and Madhukumar, A. S. (2011). Error detection and correction in communication channels using inverse gray RSNS codes. IEEETransactions on communications, 59(4), 975-986.
How to cite this paper
@article{1704922,
author = {Janet Lilian Maina, John Wanyonyi Matuya, Edward Njuguna, Vincent Nyongesa Marani},
title = {Classification of Some Internal Structures of Degree 120 Related to a Group of Extension O_8^+ (2): 2},
journal = {Iconic Research And Engineering Journals},
year = {2023},
volume = {7},
number = {2},
pages = {626-629},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1704922.pdf},
abstract = {This paper uses the modular representation method to classify the internal structures of degree 120 related to a group of extension,O_8^+ (2): 2.Specifically, we determine the number of binary linear codes and construct their lattice structure, as well as investigate the properties of some linear codes and designs of minimum weights. Our findings reveal that there are 12 binary linear codes, consisting of 4 doubly even codes, 4 projective codes, 2 irreducible codes, and 2 decomposable codes. We also identify 2 primitive 1-designs of minimum weight. The results demonstrate the potential benefits of using linear codes and designs from finite groups of extension with modular representation methods, such as improved error correction, increased data storage capacity, improved security, efficient designs, and improved computational efficiency. However, it is important to note that this topic can be complex and technical, and we recommend that stakeholders collaborate with experts in the field to ensure the accuracy and reliability of the information being used. Overall, this study contributes to the understanding of the modular representation method and its applications in coding theory and related fields.},
month = {August},
}