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

DOI10.3103/S0278641923040179WikidataQ128561988 ScholiaQ128561988MaRDI QIDQ6545501FDOQ6545501

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)

Cites Work

• On decoding by error location and dependent sets of error positions
• Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
• Title not available (Why is that?)
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
• Square Code Attack on a Modified Sidelnikov Cryptosystem
• Effective attack on the McEliece cryptosystem based on Reed-Muller codes
• A Polynomial-Time Attack on the BBCRS Scheme
• Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes

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)