Efficient generation of binary words of given weight

DOI10.1007/3-540-60693-9_20MaRDI QIDQ4608510zbMATH OpenOpenAlexFDO

Authors Nicolas Sendrier

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_20

Mathematics Subject Classification ID

Combinatorics on words (68R15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• scientific article; zbMATH DE number 4112524
• An efficient algorithm for software generation of binary linear recurrences
• A method for efficiently computing the number of codewords of fixed weights in linear codes
• Fast enumeration algorithm for words with given constraints on run lengths of ones
• Моментные характеристики весов векторов в случайных двоичных линейных кодах

Cites work

• A public-key cryptosystem based on binary Reed-Muller codes
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)

Cited in

(4)

• A code-based signature scheme from the Lyubashevsky framework
• scientific article; zbMATH DE number 2124073 (Why is no real title available?)
• The coolest way to generate binary strings
• Computer algebra tales on Goppa codes and McEliece cryptography

This page was built for publication: Efficient generation of binary words of given weight

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608510)