An algorithm for finding minimum-weight words in large linear codes is developed. It improves all previous attacks on the public-key cryptosystems based on codes and it notably points out some weaknesses in McEliece's (1978) cipher. We also determine with it the minimum distance of some BCH codes of length 511.
No takes yet. Share an insight, caveat, or question.
Canteaut et al. (1998) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: