z-logo
open-access-imgOpen Access
How easy is code equivalence over Fq?
Author(s) -
Nicolas Sendrier,
Simos Dimitrios
Publication year - 2013
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - computer science , equivalence (formal languages) , code (set theory) , programming language , theoretical computer science , algorithm , discrete mathematics , mathematics , set (abstract data type)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here