Navigation auf zora.uzh.ch

Search ZORA

ZORA (Zurich Open Repository and Archive)

Efficient Description of some Classes of Codes using Group Algebras

Chimal-Dzul, Henry; Gassner, Niklas; Rosenthal, Joachim; Schnyder, Reto (2022). Efficient Description of some Classes of Codes using Group Algebras. IFAC-PapersOnLine, 55(30):7-12.

Abstract

Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is fully specified by its first row. The ring of n x n circulant matrices can be identified with the quotient ring F[x]/(x(n) - 1). In consequence, the strong algebraic structure of the ring F[x]/(x(n) - 1) can be used to study properties of the collection of all n x n circulant matrices. The ring F[x]/(x(n) - 1) is a special case of a group algebra and elements of any finite dimensional group algebra can be represented with square matrices which are specified by a single column. In this paper we study this representation and prove that it is an injective Hamming weight preserving homomorphism of F-algebras and classify it in the case where the underlying group is abelian.

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Scopus Subject Areas:Physical Sciences > Control and Systems Engineering
Uncontrolled Keywords:Industrial and Manufacturing Engineering, Environmental Engineering Coding Theory, Linear Codes, MDPC codes, Circulant matrices, group algebras
Language:English
Date:1 January 2022
Deposited On:29 Jan 2023 08:02
Last Modified:28 Dec 2024 02:43
Publisher:Elsevier
ISSN:2405-8971
Additional Information:Conference Meeting25th International Symposium on Mathematical Theory of Networks and Systems (MTNS) LocationBayreuth, GERMANY DateSEP 12-16, 2022 SponsorsInt Federat Automat Control; German Res Fdn; Oberfrankenstiftung; Univ Bayreuth Our work is motivated by the desire to generalize the BIKE cryptosystem (a contender in the NIST competition to get a new post-quantum standard for asymmetric cryptography). Group algebras can be used to design similar cryptosystems or, more generally, to construct low density or moderate density parity-check matrices for linear codes. Copyright (C) 2022 The Authors.
OA Status:Green
Free access at:Publisher DOI. An embargo period may apply.
Publisher DOI:https://doi.org/10.1016/j.ifacol.2022.11.020
Download PDF  'Efficient Description of some Classes of Codes using Group Algebras'.
Preview
  • Content: Published Version
  • Language: English
  • Licence: Creative Commons: Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)

Metadata Export

Statistics

Citations

Altmetrics

Downloads

11 downloads since deposited on 29 Jan 2023
7 downloads since 12 months
Detailed statistics

Authors, Affiliations, Collaborations

Similar Publications