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

DOI10.1134/S1990478920020064zbMath1495.94150OpenAlexW4233757830MaRDI QIDQ5090151

Evgeniĭ Andreevich Lelyuk, V. M. Deundyak

Publication date: 15 July 2022

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da949

zbMATH Keywords

tensor productgroup codemajority decodingMLD-code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Decoding (94B35)

Related Items (1)

On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effective attack on the McEliece cryptosystem based on Reed-Muller codes
• Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
• A public-key cryptosystem based on binary Reed-Muller codes
• On the edge-independence number and edge-covering number for regular graphs
• Cryptanalysis of the Sidelnikov Cryptosystem
• On the construction of a class of majority-logic decodable codes

This page was built for publication: A Graph-Theoretical Method for Decoding Some Group MLD-Codes