Abstract
A study is performed of the algebraic properties of the Hadamard product (Schur product, component-wise product) of linear error-correcting codes. The complexity of constructing a product basis using known multiplier bases is discussed. The concept is introduced of quotient, quasi-quotient, and maximal inclusion quasi-quotient obtained from the Hadamard division of one linear code by another. An explicit form of the maximum Hadamard division quasi-quotient is established. A criterion is proved for the existence of a given code of an inverse code in a semiring formed by linear codes of length \(n\) with the operations of sum and product of Hadamard codes. The explicit form of codes that have a reverse code in this semiring is described.
This is a preview of subscription content, log in via an institution to check access.
REFERENCES
J. R. McEliece, ‘‘A public-key cryptosystem based on algebraic coding theory,’’ DSN Progress Report 42–44 (Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, 1978), pp. 114–116.
H. Niederreiter, ‘‘Knapsack type cryptosystems and algebraic coding theory,’’ Probl. Control Inf. Theory 15 (2), 159–166 (1986).
R. Pellikaan, ‘‘On decoding by error location and dependent sets of error positions,’’ Discrete Math. 106–107, 369–381 (1992). https://doi.org/10.1016/0012-365X(92)90567-Y
C. Wieschebrink, ‘‘Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes,’’ in Post-Quantum Cryptography, PQCrypto 2010, Ed. by N. Sendrier, Lecture Notes in Computer Science, Vol. 6061 (Springer, Berlin, 2010), pp. 61–72 (2010). https://doi.org/10.1007/978-3-642-12929-2_5
M. A. Borodin and I. V. Chizhov, ‘‘Effective attack on the McEliece cryptosystem based on Reed–Muller codes,’’ Discrete Math. Appl. 24 (5), 273–280 (2014). https://doi.org/10.1515/dma-2014-0024
A. Couvreur, P. Gaborit, V. Gauthier-Umaña, A. Otmani, and J.-P. Tillich, ‘‘Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes,’’ Des. Codes Cryptogr. 73, 641–666 (2014). https://doi.org/10.1007/s10623-014-9967-z
A. Couvreur, I. Márquez-Corbella, and R. Pellikaan, ‘‘Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes,’’ in Coding Theory and Applications, Ed. by R. Pinto, P. Rocha Malonek, and P. Vettori, CIM Series in Mathematical Sciences, Vol. 3 (Springer, Cham, 2015), pp. 133–140. https://doi.org/10.1007/978-3-319-17296-5_13
A. Couvreur, A. Otmani, and J.-P. Tillich, ‘‘Polynomial time attack on wild McEliece over quadratic extensions,’’ IEEE Trans. Inf. Theory 63 (1), 404–427 (2017). https://doi.org/10.1109/TIT.2016.2574841
A. Couvreur, A. Otmani, J.-P. Tillich, and V. Gauthier-Umaña, ‘‘A polynomial-time attack on the BBCRS scheme,’’ in Public-Key Cryptography – PKC 2015, Ed. by J. Katz, Lecture Notes in Computer Science, Vol. 9020 (Springer, Berlin, 2015), pp. 175–193. https://doi.org/10.1007/978-3-662-46447-2_8
A. Otmani and H. Kalachi, ‘‘Square code attack on a modified Sidelnikov cryptosystem,’’ in Codes, Cryptology, and Information Security, C2SI 2015, Ed. by S. El Hajji, A. Nitaj, et al., Lecture Notes in Computer Science, Vol. 9084 (Springer, Cham, 2015), pp. 173–183. https://doi.org/10.1007/978-3-319-18681-8_14
Funding
This work was supported by ongoing institutional funding. No additional grants to perform or direct our research were obtained.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The author of this work declares that he has no conflicts of interest.
Additional information
Translated by L. Trubitsyna
Publisher’s Note.
Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Chizhov, I.V. A Hadamard Product of Linear Codes: Algebraic Properties and Algorithms for Calculating It. MoscowUniv.Comput.Math.Cybern. 47, 239–250 (2023). https://doi.org/10.3103/S0278641923040179
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0278641923040179