Asymptotic improvements to provable algorithms for the code equivalence problem

DOI10.1109/TIT.2025.3637683MaRDI QIDQ6842410zbMATH OpenFDO

Authors Huck Bennett, Drisana Bhatia, Jean-François Biasse, Medha Durisheti, Lucas LaBuff, Vincenzo Pallozzi Lavorante, Philip Waitkevich

Publication date 18 March 2026

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2025.3637683

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(1)

• A survey on code equivalence: the state-of-the-art and open questions

This page was built for publication: Asymptotic improvements to provable algorithms for the code equivalence problem

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