The role of rings and modules in algebraic coding theory and cryptology (Q2715917)

From MaRDI portal





scientific article; zbMATH DE number 1600681
Language Label Description Also known as
default for all languages
No label defined
    English
    The role of rings and modules in algebraic coding theory and cryptology
    scientific article; zbMATH DE number 1600681

      Statements

      0 references
      29 May 2001
      0 references
      residue class codes
      0 references
      linear codes
      0 references
      Morita equivalence
      0 references
      secret sharing
      0 references
      control schemes
      0 references
      information rates
      0 references
      rings
      0 references
      modules
      0 references
      algebraic coding theory
      0 references
      cryptology
      0 references
      weight functions
      0 references
      modulation schemes
      0 references
      finite Dedekind rings
      0 references
      cyclic codes
      0 references
      Hamming isometries
      0 references
      decoding
      0 references
      Reed-Muller codes
      0 references
      quaternary Preparata codes
      0 references
      lifts of the Golay codes
      0 references
      matrix rings
      0 references
      metric continuation
      0 references
      The role of rings and modules in algebraic coding theory and cryptology (English)
      0 references
      This habilitation paper is devoted to the fundamental role of rings and modules in algebraic coding theory and cryptology. It is organized as follows:NEWLINENEWLINENEWLINEChapter 1: Rings, weight functions and modulation schemes (Classes of finite Dedekind rings, Weights and their symmetry groups, Modulation schemes);NEWLINENEWLINENEWLINEChapter 2: Algebraic coding theory over rings (Characterization of cyclic codes, Monomial representation of homogeneous isometries, Characterization of Hamming isometries);NEWLINENEWLINENEWLINEChapter 3: Efficient decoding of linear codes over chain rings (\(p\)-adic representations, Decoding free codes, Application to quaternary Reed-Muller codes);NEWLINENEWLINENEWLINEChapter 4: Residue class codes under selected weights (The quaternary Preparata codes and their decodings, On \(\mathbb{Z}_4\) and \(\mathbb{Z}_9\) lifts of the Golay codes and their decoding, Construction of a ternary \((36,3^{12},15)\)-code;NEWLINENEWLINENEWLINEChapter 5: Linear codes and matrix rings (Morita equivalence and its metric continuation, Matrix representations of linear codes); andNEWLINENEWLINENEWLINEChapter 6: Secret sharing over partially ordered sets (Control schemes and homogeneity, Information rates and perfection, Construction of perfect control schemes, An example).NEWLINENEWLINENEWLINENote that the author has published some of these results in English [\textit{M. Greferath} and \textit{S. E. Schmidt}, Linear codes and rings of matrices, Lect. Notes Comput. Sci. 1719, 160-169 (1999; Zbl 0989.94029)] and \textit{M. Greferath}, Discrete Math. 177, 273-277 (1997; Zbl 0886.94014)].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references