The syndromes decoding algorithm in group codes
From MaRDI portal
For semisimple algebras \(\mathbb{K}G\), a general and efficient decoding algorithm for group codes is provided. This method is based on the syndrome decoding algorithm and uses the decomposition of a semisimple group algebra as a direct sum of two-sided ideals generated by a central idempotent of \(\mathbb{K}G\). For the abelian case a simpler version of this algorithm is presented. Some examples are given to describe the process of this algorithm.
Recommendations
- An algorithm for generalized syndrome decoding problem
- scientific article; zbMATH DE number 492659
- scientific article; zbMATH DE number 3487347
- Reflection Group Codes and Their Decoding
- Groups and decompositions of codes
- On the action of the symmetric group on error-correcting codes
- On the theory of group codes
- Codes in group algebras
- Syndrome decoding for Hermite codes with a Sugiyama-type algorithm
- On syndrome decoding of punctured Reed-Solomon and Gabidulin codes
Cites work
- A public-key cryptosystem based on binary Reed-Muller codes
- A reaction attack on the QC-LDPC McEliece cryptosystem
- Algebraic attack against variants of McEliece with Goppa polynomial of a special form
- An intrinsical description of group codes
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- Cryptanalysis of the Sidelnikov Cryptosystem
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Enhanced public key security for the McEliece cryptosystem
- Group codes over non-abelian groups
- How to mask the structure of codes for a cryptographic use
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 3212917 (Why is no real title available?)
- scientific article; zbMATH DE number 3305202 (Why is no real title available?)
- McEliece public key cryptosystems using algebraic-geometric codes
- New examples of non-abelian group codes
- Non-abelian group codes over an arbitrary finite field
- On the edge-independence number and edge-covering number for regular graphs
- Public Key Cryptography - PKC 2006
- Reducing Key Length of the McEliece Cryptosystem
- Reducing the key size of McEliece cryptosystem from automorphism-induced Goppa codes via permutations
- When are all group codes of a noncommutative group abelian (a computational approach)?
Cited in
(10)- On a complete decoding scheme for binary radical codes
- Coset decomposition method for decoding linear codes
- A semigroup approach to complete decoding
- Semisimple group codes and dihedral codes
- scientific article; zbMATH DE number 492659 (Why is no real title available?)
- Syndrome Decoding Estimator
- A graph-theoretical method for decoding some group MLD-codes
- Twisted group algebra of dihedral groups over finite fields
- Decoding algorithms in group codes
- On the square code of group codes
This page was built for publication: The syndromes decoding algorithm in group codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156920)
