A new algorithm for finding minimum-weight words in large linear codes
From MaRDI portal
(Redirected from Publication:4608514)
Recommendations
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- scientific article; zbMATH DE number 4112524
- scientific article; zbMATH DE number 1302794
- Cryptanalysis of McEliece’s Public-Key Cryptosystem
- scientific article; zbMATH DE number 4070796
Cites work
- A new identification scheme based on syndrome decoding
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- scientific article; zbMATH DE number 4179278 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1088909 (Why is no real title available?)
- Iterative decoding of linear codes by a modulo-2 linear program
Cited in
(4)- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- On the complexity of some cryptographic problems based on the general decoding problem
This page was built for publication: A new algorithm for finding minimum-weight words in large linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608514)