A Hadamard product of linear codes: algebraic properties and algorithms for calculating it

DOI10.3103/S0278641923040179MaRDI QIDQ6545501zbMATH OpenWikidataFDO

Authors Ivan V. Chizhov

Publication date 29 May 2024

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

algorithmMcEliece cryptosystemHadamard quotientcomponent-wise product of linear codesHadamard product of linear codesHadamard quasi-quotientmaximum Hadamard quasi-quotientSchur product of linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)

Recommendations

• scientific article; zbMATH DE number 7339515
• Constructing linear codes by Hadamard matrices
• On the Hadamard product of balancing \(Q^n_B\) matrix and balancing \(Q_B^{-n}\) matrix
• On products and powers of linear codes under componentwise multiplication

Cites work

• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• A Polynomial-Time Attack on the BBCRS Scheme
• Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
• Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• Effective attack on the McEliece cryptosystem based on Reed-Muller codes
• On decoding by error location and dependent sets of error positions
• Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
• Square code attack on a modified Sidelnikov cryptosystem

This page was built for publication: A Hadamard product of linear codes: algebraic properties and algorithms for calculating it

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