Publication:

Efficient Description of some Classes of Codes using Group Algebras

Date

Date

Date
2022
Journal Article
Published version

Citations

Citation copied

Chimal-Dzul, H., Gassner, N., Rosenthal, J., & Schnyder, R. (2022). Efficient Description of some Classes of Codes using Group Algebras. IFAC-PapersOnLine, 55, 7–12. https://doi.org/10.1016/j.ifacol.2022.11.020

Abstract

Abstract

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

Metrics

Downloads

2 since deposited on 2023-01-29
Acq. date: 2025-11-13

Views

2 since deposited on 2023-01-29
Acq. date: 2025-11-13

Citations

Additional indexing

Creators (Authors)

Journal/Series Title

Journal/Series Title

Journal/Series Title

Volume

Volume

Volume
55

Number

Number

Number
30

Page range/Item number

Page range/Item number

Page range/Item number
7

Page end

Page end

Page end
12

Item Type

Item Type

Item Type
Journal Article

Dewey Decimal Classifikation

Dewey Decimal Classifikation

Dewey Decimal Classifikation

Keywords

Industrial and Manufacturing Engineering, Environmental Engineering Coding Theory, Linear Codes, MDPC codes, Circulant matrices, group algebras

Language

Language

Language
English

Publication date

Publication date

Publication date
2022-01-01

Date available

Date available

Date available
2023-01-29

Publisher

Publisher

Publisher

ISSN or e-ISSN

ISSN or e-ISSN

ISSN or e-ISSN
2405-8971

Additional Information

Additional Information

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

OA Status

OA Status
Green

Free Access at

Free Access at

Free Access at
DOI

Metrics

Downloads

2 since deposited on 2023-01-29
Acq. date: 2025-11-13

Views

2 since deposited on 2023-01-29
Acq. date: 2025-11-13

Citations

Citations

Citation copied

Chimal-Dzul, H., Gassner, N., Rosenthal, J., & Schnyder, R. (2022). Efficient Description of some Classes of Codes using Group Algebras. IFAC-PapersOnLine, 55, 7–12. https://doi.org/10.1016/j.ifacol.2022.11.020

Green Open Access
Loading...
Thumbnail Image

Files

Files

Files
Files available to download:1

Files

Files

Files
Files available to download:1
Loading...
Thumbnail Image