{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:21Z","timestamp":1773378021840,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849855","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2464-2468","source":"Crossref","is-referenced-by-count":21,"title":["Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial"],"prefix":"10.1109","author":[{"given":"Magali","family":"Bardet","sequence":"first","affiliation":[{"name":"Normandie Univ, France; UR, LITIS, Mont-Saint-Aignan, F-76821, France"}]},{"given":"Ayoub","family":"Otmani","sequence":"additional","affiliation":[{"name":"Normandie Univ, France; UR, LITIS, Mont-Saint-Aignan, F-76821, France"}]},{"given":"Mohamed","family":"Saeed-Taha","sequence":"additional","affiliation":[{"name":"Normandie Univ, France; UR, LITIS, Mont-Saint-Aignan, F-76821, France"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480195294027"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38616-9_14"},{"key":"ref12","article-title":"Algebraic approach for code equivalence","author":"saeed-taha","year":"2017","journal-title":"Ph D Dissertation"},{"key":"ref13","article-title":"Cryptosystèmes à clé publique basés sur les codes correcteurs d’erreurs","author":"sendrier","year":"2002","journal-title":"Mémoire d’habilitation à diriger des recherches Université Paris 6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/9789812772022_0009"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2009.3.363"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.623157"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29360-8_9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.107"},{"key":"ref5","article-title":"Graph isomorphism in quasipolynomial time","author":"babai","year":"2015","journal-title":"CoRR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056498"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_20"},{"key":"ref1","first-page":"114","author":"mceliece","year":"1978","journal-title":"A public-key system based on algebraic coding theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.850662"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849855.pdf?arnumber=8849855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:56Z","timestamp":1773347756000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849855\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849855","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}