A graph-theoretical method for decoding some group MLD-codes
From MaRDI portal
Recommendations
Cites work
- A public-key cryptosystem based on binary Reed-Muller codes
- Coding theory
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- Cryptanalysis of the Sidelnikov Cryptosystem
- Effective attack on the McEliece cryptosystem based on Reed-Muller codes
- scientific article; zbMATH DE number 3485627 (Why is no real title available?)
- scientific article; zbMATH DE number 3555872 (Why is no real title available?)
- scientific article; zbMATH DE number 3212917 (Why is no real title available?)
- scientific article; zbMATH DE number 3314865 (Why is no real title available?)
- On the construction of a class of majority-logic decodable codes
- On the edge-independence number and edge-covering number for regular graphs
Cited in
(5)- scientific article; zbMATH DE number 721914 (Why is no real title available?)
- On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes
- The McEliece-type cryptosystem based on D-codes
- On decomposability of Schur-Hadamard product of the tensor products sum of Reed-Muller codes
- On the parameters of a McEliece-type cryptosystem on D-codes based on binary Reed-Muller codes
This page was built for publication: A graph-theoretical method for decoding some group MLD-codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090151)