Skip to main content
SpringerLink
Log in

A Graph-Theoretical Method for Decoding Some Group MLD-Codes

Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

We construct the class of majority-logical decodable group codes using a method for combining the codes that are based on the tensor product and the sum of codes. The construction of this class rests on the Kasami–Lin technique, which allows us to consider not only individual codes but also families of codes and utilizes the \(M\)-orthogonality construction presented by Massey that is important for the majority-logical decodable codes. The codes under study are ideals in group algebras over, generally speaking, noncommutative finite groups. Some algorithmic model of the majority decoding for the codes under consideration is developed that is based on the graph-theoretic approach. An important part of this model is the construction of a special decoding graph for decoding one coordinate of a noisy codeword corresponding to this graph. The group properties of the codes enable us to quickly find decoding graphs for the remaining coordinates. We develop some decoding algorithm that corrects the errors in all coordinates of the noisy codeword using this decoding graphs. As an example of families of group codes, we give the Reed–Muller binary codes important in cryptography. The code cryptosystems are considered as an alternative to the number-theoretic cryptosystems widely used at present since they are resistant to attacks by quantum computers. The relevance of the problem under consideration lies in the fact that the use of group codes and their various combinations is currently one of the promising ways to increase the stability of code cryptosystems because enables us to construct new codes with a complex algebraic structure, which positively affects the stability of the code cryptosystems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price includes VAT (Canada)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.

REFERENCES

  1. J. L. Massey, Threshold Decoding (MIT Press, Cambridge, MA, 1963).

    Book  Google Scholar 

  2. G. C. Clark, Jr., and J. B. Cain, Error-Correction Coding for Digital Communications (Radiosvyaz’, Moscow, 1981) [in Russian].

  3. V. M. Sidel’nikov, “Open Encryption Based on Binary Reed–Muller Codes,” Diskret. Mat. 6 (2), 3–20 (1994).

    Google Scholar 

  4. K.-Kh. Tsimmerman, Methods of Modular Representation Theory in Algebraic Coding Theory (MTsNMO, Moscow, 2011) [in Russian].

    Google Scholar 

  5. “NIST Reveals 26 Algorithms Advancing to the Post-Quantum Crypto ’Semifinals’,” National Institute of Standards and Technology. Jan. 30, 2019. http://nist.gov/news-events/news/2019/01/nist-reveals-26- algorithms-advancing-post-quantum-crypto-semifinals.

  6. M. A. Borodin and I. V. Chizhov, “Effective Attack on the McEliece Cryptosystem Based on Reed-Muller Codes,” Discrete Math. Appl. 26 (1), 273–280 (2014).

    MATH  Google Scholar 

  7. L. Minder and A. Shokrollahi, “Cryptanalysis of the Sidelnikov Cryptosystem,” in Advances in Cryptology—EUROCRYPT 2007: Proceedings of 26th Annual International Conference on Theory and Applications of Cryptography Techniques (Barcelona, Spain, May 20–24, 2007) (Springer, Heidelberg, 2007), pp. 347–360 [Lecture Notes in Computer Science, Vol. 4515].

  8. V. M. Sidel’nikov and S. O. Shestakov, “On an Encoding System Constructed on the Basis of Generalized Reed–Solomon Codes,” Discrete Math. Appl. 2 (4), 439–444 (1992).

    MathSciNet  MATH  Google Scholar 

  9. C. Wieschebrink, “Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes,” Post-Quantum Cryptography:Proceedings of the Third International Workshop (Darmstadt, Germany, May 25–28, 2010) (Springer, Heidelberg, 2010), pp. 61–72 [Lecture Notes in Computer Science, Vol. 6061].

  10. V. M. Deundyak and Y. V. Kosolapov, “Cryptosystem Based on Induced Group Codes,” Model. Anal. Inform. Sist. 23 (2), 137–152 (2016).

    Article  MathSciNet  Google Scholar 

  11. V. M. Deundyak, Y. V. Kosolapov, and E. A. Lelyuk, “Decoding the Tensor Product of MLD Codes and Applications to Code Cryptosystems,” Model. Anal. Inform. Sist.24 (2), 239–252 (2017) [Automat. Control and Comput. Sci. 52 (7), 647–657, 2018].

    Article  Google Scholar 

  12. T. Kasami and S. Lin, “On the Construction of a Class of Majority-Logic Decodable Codes,” IEEE Trans. Inform. Theory IT-17 (5), 600–610 (1971).

    Article  MathSciNet  Google Scholar 

  13. V. M. Sidel’nikov, Coding Theory (Fizmatlit, Moscow, 2008) [in Russian].

    MATH  Google Scholar 

  14. R. H. Morelos-Zaragoza, The Art of Error Correcting Coding (John Wiley & Sons, Chichester, 2006).

    Book  Google Scholar 

  15. V. M. Deundyak and Y. V. Kosolapov, “Algorithms for Majority Decoding of Group Codes,” Model. Anal. Inform. Sist. 22 (4), 464–482 (2015).

    Article  MathSciNet  Google Scholar 

  16. E. L. Blokh and V. V. Zyablov, “Coding of Generalized Concatenated Codes,” Problemy Peredachi Informatsii 10 (3), 45–50 (1974).

    MathSciNet  MATH  Google Scholar 

  17. V. A. Zinov’ev, “Generalized Concatenated Codes,” Problemy Peredachi Informatsii 12 (1), 5–15, (1976).

    MathSciNet  MATH  Google Scholar 

  18. C. W. Curtis and I. Reiner, Representation Theory of Finite Groups and Associative Algebras (Interscience Publ., New York, 1962).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vorovich Institute of Mathematics, Mechanics, and Computer Science, Rostov-on-Don, 344058, Russia

    V. M. Deundyak & E. A. Lelyuk

  2. Scientific and Research Institute “Spetsvuzavtomatika”, Rostov-on-Don, 344002, Russia

    V. M. Deundyak

Authors
  1. V. M. Deundyak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. A. Lelyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to V. M. Deundyak or E. A. Lelyuk.

Additional information

Translated by Ya.A. Kopylov

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Deundyak, V.M., Lelyuk, E.A. A Graph-Theoretical Method for Decoding Some Group MLD-Codes. J. Appl. Ind. Math. 14, 265–280 (2020). https://doi.org/10.1134/S1990478920020064

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478920020064

Keywords

search

Navigation