Abstract
In this work we present an efficient algorithm that generates the leader codewords of a linear code in an incremental form. On the other hand, using the set of leader codewords we define a transformation that remains invariant only if the codes are equivalent which is used as a signature for checking the code equivalence problem. An upper bound on the weight of the codewords is imposed to this algorithm in order to get a smallest set that can be also used as a signature for the ‘Code Equivalence Problem’.
E. Martínez-Moro—Partially supported by the Spanish State Research Agency (AEI) under Grants MTM2015-65764-C3-1, PGC2018-096446-B-C21.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Babai, L., Codenotti, P., Grochow, J.A., Qiao, Y.: Code equivalence and group isomorphism. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1395–1408. Society for Industrial and Applied Mathematics (2011)
Betten, A., Braun, M., Fripertinger, H., Kerber, A., Kohnert, A., Wassermann, A.: Error-Correcting Linear Codes: Classification by Isometry and Applications, vol. 18. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-31703-1
Borges-Quintana, M., Borges-Trenard, M., Márquez-Corbella, I., Martínez-Moro, E.: Computing coset leaders and leader codewords of binary codes. J. Algebra Appl. 14(8), 19 (2015)
Borges-Quintana, M., Borges-Trenard, M., Martínez-Moro, E.: On a Gröbner bases structure associated to linear codes. J. Discrete Math. Sci. Cryptogr. 10(2), 151–191 (2007)
Borges-Quintana, M., Borges-Trenard, M., Martínez-Moro, E.: On the weak order ideal associated to linear codes. Math. Comput. Sci. 12(3), 339–347 (2018)
Braun, G., Pokutta, S.: A polyhedral characterization of border bases. SIAM J. Discrete Math. 30(1), 239–265 (2016)
Helleseth, T., Kløve, T., Levenshtein, V.I.: Error-correction capability of binary linear codes. IEEE Trans. Inf. Theory 51(4), 1408–1423 (2005)
Leon, J.S.: Computing automorphism groups of error-correcting codes. IEEE Trans. Inform. Theory 28, 496–511 (1982)
Mora, T.: Solving Polynomial Equation Systems II: Macaulay’s Paradigm and Gröbner Technology. Cambridge University Press, Cambridge (2005)
Petrank, E., Roth, R.: Is code equivalence easy to decide? IEEE Trans. Inform. Theory 43(5), 1602–1604 (1997)
Sendier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inform. Theory 46(4), 1193–1203 (2000)
Sendier, N., Simos, D.: How easy is code equivalence over \(\mathbb{F}_q\)? In: International Workshop on Coding and Cryptography (2013). https://www.rocq.inria.fr/secret/PUBLICATIONS/codeq3.pdf
Sendrier, N., Simos, D.E.: The hardness of code equivalence over \(\mathbb{F}_q\) and its application to code-based cryptography. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 203–216. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38616-9_14
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Borges-Quintana, M., Borges-Trenard, M.Á., Martínez-Moro, E., Torres-Guerrero, G. (2020). Computing an Invariant of a Linear Code. In: Slamanig, D., Tsigaridas, E., Zafeirakopoulos, Z. (eds) Mathematical Aspects of Computer and Information Sciences. MACIS 2019. Lecture Notes in Computer Science(), vol 11989. Springer, Cham. https://doi.org/10.1007/978-3-030-43120-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-43120-4_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43119-8
Online ISBN: 978-3-030-43120-4
eBook Packages: Computer ScienceComputer Science (R0)