On maximum distance separable group codes with complementary duals
Saikat Roy, Satya Bagchi

TL;DR
This paper investigates the structural relationship between maximum distance separable (MDS) LCD group codes and their underlying groups, providing parameter estimations and generalizations using group theory and Sylow theorems.
Contribution
It offers new insights into the subgroup structures of LCD MDS group codes and generalizes existing results using Sylow theorems.
Findings
Estimation of parameters for LCD group codes under certain conditions
Enhanced understanding of the relationship between group and code structures
Generalization of Cruz and Willems' result using Sylow theorems
Abstract
Given an LCD group code in a group algebra , we inspect kinship between and , more precisely between the subgroup structures of and . Under some special circumstances our inspection provides an estimation for various parameters of a group code . When is MDS, the inter relation between and becomes more impressive. Application of Sylow theorem facilitated us to explore the inter relation between and (when is LCD and MDS) in more general way and finally we get the result of Cruz and Willems (Lemma ) as a simple sequel.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Coding theory and cryptography · graph theory and CDMA systems
