A new algorithm for finding minimum-weight words in large linear codes

DOI10.1007/3-540-60693-9_24zbMath1398.94102OpenAlexW1574541063MaRDI QIDQ4608514

Anne Canteaut

Publication date: 21 March 2018

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60693-9_24

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60)

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative decoding of linear codes by a modulo-2 linear program
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• A new identification scheme based on syndrome decoding

This page was built for publication: A new algorithm for finding minimum-weight words in large linear codes