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

被引：0

|

作者：

INRIA-Project Codes, Le Chesnay, France ^{[1
]}

机构：

来源：

IEEE Trans Inf Theory | / 1卷 / 367-378期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 2 条

[1] 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
Canteaut, A
Chabaud, F
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) : 367 - 378
[2] A new algorithm for finding minimum-weight in large linear codes
Canteaut, A
CRYPTOGRAPHY AND CODING: 5TH IMA CONFERENCE, 1995, 1025 : 205 - 212