[IEEE 2019 IEEE International Symposium on Information Theory (ISIT) - Paris, France (2019.7.7-2019.7.12)] 2019 IEEE International Symposium on Information Theory (ISIT) - Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial
Bardet, Magali, Otmani, Ayoub, Saeed-Taha, MohamedAnnée:
2019
DOI:
10.1109/ISIT.2019.8849855
Fichier:
PDF, 334 KB
2019