Block components of generalized quaternion group codes
Nadja Willenborg

TL;DR
This paper analyzes the structure of codes in the generalized quaternion group algebra over finite fields, providing a decomposition approach and applying it to cyclic group codes.
Contribution
It introduces a method to decompose codes in $ ext{GF}_q[Q_{4n}]$ using Wedderburn decomposition and characterizes their generating idempotents.
Findings
Decomposition of codes into direct sums of components.
Explicit description of code blocks via idempotents.
Application to cyclic group codes.
Abstract
Codes in the generalized quaternion group algebra are considered. Restricting to char the structure of an arbitrary code is described via the Wedderburn decomposition. Moreover it is known that in this case every code has a generating idempotent . Given the generating idempotent of a code we determine the different components in its decomposition Afterwards we apply this result to describe the blocks of codes induced by cyclic group codes.
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
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research
