activity
20092026
most citedOn the computation of the HNF of a module over the ring of integers of a number field

13 citations · 27 across the 12 of their papers we have counts for

collaborators
Showing cs.CCShow all

2 papers · 1 filter

cs.CC2026

A search-to-decision reduction for the linear code equivalence problem

Jean-François Biasse, Giacomo Micheli, Benjamin Prada +1

We present a polynomial-time reduction from the search variant of the linear code equivalence problem (i.e. the search for a linear isometry between the inputs) to its decisional v…

cs.CC2026

Code Equivalence and Automorphism Problems for Codes

Jean-Francois Biasse, Alexandra V. Hostetler, Anuvrat Jaindungarwal

We study the complexity of the Code Equivalence problem and show that it is polynomially equivalent to several computational automorphism problems for codes. These problems ask for…