OpenAlex
PricingAboutJobs
Log inGet started
Work

Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem

HTML

Year: 2025
Type: article
Source: IEEE Transactions on Information Theory
DOI: 10.1109/tit.2025.3637683
Authors: Huck Bennett, Drisana Bhatia, Jean-François Biasse, Medha Durisheti, Lucas LaBuff, Vincenzo Pallozzi Lavorante, Philip Waitkevich
Institutions: University of Colorado Boulder, University of California, Berkeley, University of South Florida, Virginia Tech, University of Maryland, College Park

Topic: Coding theory and cryptography
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences

Open Access status: closed

Funder: National Science Foundation
Award: REU Site: Cryptography and Coding Theory at the University of South Florida
OpenAlex ID: W4416707312
FWCI: 0.825
Cites: 32
Cited by: 2
Related to:
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms