{"title":"Decoding algorithms in group codes","authors":"C. Martínez, F. Molina, A. Piñera-Nicolás","doi":"10.1016/j.ffa.2025.102692","DOIUrl":null,"url":null,"abstract":"<div><div>Group codes are linear codes that can be identified with (two-sided) ideals of a group algebra <span><math><mi>K</mi><mi>G</mi></math></span>. Assuming that <span><math><mi>K</mi><mi>G</mi></math></span> is semisimple, we use its decomposition as the direct sum of two ideals, one of them the group code, to design two decoding algorithms. The first one generalizes Meggitt's algorithm designed for cyclic codes, while the other one is inspired in the decoding algorithm studied in <span><span>[10]</span></span> and aims to improve it.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"108 ","pages":"Article 102692"},"PeriodicalIF":1.2000,"publicationDate":"2025-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579725001224","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Group codes are linear codes that can be identified with (two-sided) ideals of a group algebra . Assuming that is semisimple, we use its decomposition as the direct sum of two ideals, one of them the group code, to design two decoding algorithms. The first one generalizes Meggitt's algorithm designed for cyclic codes, while the other one is inspired in the decoding algorithm studied in [10] and aims to improve it.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.