{"id":"https://openalex.org/W2943595314","doi":"https://doi.org/10.1109/isit.2019.8849855","title":"Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial","display_name":"Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2943595314","doi":"https://doi.org/10.1109/isit.2019.8849855","mag":"2943595314"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849855","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849855","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1905.00073","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Magali Bardet","orcid":null},"institutions":[{"id":"https://openalex.org/I4210105918","display_name":"Normandie Universit\u00e9","ror":"https://ror.org/01k40cz91","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Magali Bardet","raw_affiliation_strings":["Normandie Univ, France; UR, LITIS, Mont-Saint-Aignan, F-76821, France"],"affiliations":[{"raw_affiliation_string":"Normandie Univ, France; UR, LITIS, Mont-Saint-Aignan, F-76821, France","institution_ids":["https://openalex.org/I4210105918"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ayoub Otmani","orcid":null},"institutions":[{"id":"https://openalex.org/I4210105918","display_name":"Normandie Universit\u00e9","ror":"https://ror.org/01k40cz91","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ayoub Otmani","raw_affiliation_strings":["Normandie Univ, France; UR, LITIS, Mont-Saint-Aignan, F-76821, France"],"affiliations":[{"raw_affiliation_string":"Normandie Univ, France; UR, LITIS, Mont-Saint-Aignan, F-76821, France","institution_ids":["https://openalex.org/I4210105918"]}]},{"author_position":"last","author":{"id":null,"display_name":"Mohamed Saeed-Taha","orcid":null},"institutions":[{"id":"https://openalex.org/I4210105918","display_name":"Normandie Universit\u00e9","ror":"https://ror.org/01k40cz91","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohamed Saeed-Taha","raw_affiliation_strings":["Normandie Univ, France; UR, LITIS, Mont-Saint-Aignan, F-76821, France"],"affiliations":[{"raw_affiliation_string":"Normandie Univ, France; UR, LITIS, Mont-Saint-Aignan, F-76821, France","institution_ids":["https://openalex.org/I4210105918"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210105918"],"apc_list":null,"apc_paid":null,"fwci":0.2893,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.65183177,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2464","last_page":"2468"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/permutation-matrix","display_name":"Permutation matrix","score":0.6664999723434448},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.5252000093460083},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4634000062942505},{"id":"https://openalex.org/keywords/generalized-permutation-matrix","display_name":"Generalized permutation matrix","score":0.46239998936653137},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.45719999074935913},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4162999987602234},{"id":"https://openalex.org/keywords/vector-space","display_name":"Vector space","score":0.40369999408721924},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.40299999713897705},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.3921000063419342},{"id":"https://openalex.org/keywords/equivalence-class","display_name":"Equivalence class (music)","score":0.36570000648498535}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7799000144004822},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6919000148773193},{"id":"https://openalex.org/C84140500","wikidata":"https://www.wikidata.org/wiki/Q851512","display_name":"Permutation matrix","level":3,"score":0.6664999723434448},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5774000287055969},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.5252000093460083},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4634000062942505},{"id":"https://openalex.org/C20295870","wikidata":"https://www.wikidata.org/wiki/Q5532500","display_name":"Generalized permutation matrix","level":4,"score":0.46239998936653137},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.45719999074935913},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4162999987602234},{"id":"https://openalex.org/C13336665","wikidata":"https://www.wikidata.org/wiki/Q125977","display_name":"Vector space","level":2,"score":0.40369999408721924},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.40299999713897705},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.3921000063419342},{"id":"https://openalex.org/C2777044963","wikidata":"https://www.wikidata.org/wiki/Q5384707","display_name":"Equivalence class (music)","level":2,"score":0.36570000648498535},{"id":"https://openalex.org/C73361133","wikidata":"https://www.wikidata.org/wiki/Q4810150","display_name":"Association scheme","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C77670614","wikidata":"https://www.wikidata.org/wiki/Q212130","display_name":"Cyclic permutation","level":3,"score":0.32030001282691956},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.31290000677108765},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.311599999666214},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3052999973297119},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C175473596","wikidata":"https://www.wikidata.org/wiki/Q4918660","display_name":"Bit-reversal permutation","level":4,"score":0.29010000824928284},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.27959999442100525},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C145633696","wikidata":"https://www.wikidata.org/wiki/Q1401935","display_name":"Partial permutation","level":4,"score":0.2621999979019165},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.25870001316070557}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2019.8849855","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849855","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1905.00073","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.00073","pdf_url":"https://arxiv.org/pdf/1905.00073","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-02310495v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02310495","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT), Jul 2019, Paris, France. pp.2464-2468, ⟨10.1109/ISIT.2019.8849855⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1905.00073","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.00073","pdf_url":"https://arxiv.org/pdf/1905.00073","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1976677460","https://openalex.org/W1990600049","https://openalex.org/W1999774889","https://openalex.org/W2037078554","https://openalex.org/W2082432729","https://openalex.org/W2107670183","https://openalex.org/W2119117325","https://openalex.org/W2126474167","https://openalex.org/W2156052684","https://openalex.org/W2293242706","https://openalex.org/W2378368070","https://openalex.org/W2899705800","https://openalex.org/W4239350281","https://openalex.org/W6687656297"],"related_works":[],"abstract_inverted_index":{"The":[0,94],"paper":[1],"deals":[2],"with":[3,69,73,91,122],"the":[4,24,32,57,63,105,113,116],"problem":[5,27],"of":[6,23,83,107,111,115],"deciding":[7],"if":[8,46],"two":[9,47],"finite-dimensional":[10],"linear":[11,89],"subspaces":[12],"over":[13],"an":[14,76],"arbitrary":[15,77],"field":[16],"are":[17,51],"identical":[18],"up":[19,144],"to":[20,30,41,75,103,145],"a":[21,42,81,108,139],"permutation":[22,33,58,132],"coordinates.":[25],"This":[26],"is":[28,86,96],"referred":[29],"as":[31],"code":[34,59,133],"equivalence.":[35],"We":[36],"show":[37,130],"that":[38,44,62,131],"given":[39],"access":[40],"subroutine":[43],"decides":[45],"weighted":[48],"undirected":[49],"graphs":[50],"isomorphic,":[52],"one":[53],"may":[54],"deterministically":[55],"decide":[56],"equivalence":[60,134],"provided":[61],"underlying":[64],"vector":[65,84],"spaces":[66,85],"intersect":[67],"trivially":[68],"their":[70],"orthogonal":[71],"complement":[72],"respect":[74],"inner":[78],"product.":[79],"Such":[80],"class":[82],"usually":[87],"called":[88],"codes":[90,126],"trivial":[92,128],"hulls.":[93],"reduction":[95],"efficient":[97],"because":[98],"it":[99],"essentially":[100],"boils":[101],"down":[102],"computing":[104],"inverse":[106],"square":[109],"matrix":[110],"order":[112],"length":[114],"involved":[117],"codes.":[118],"Experimental":[119],"results":[120],"obtained":[121],"randomly":[123],"drawn":[124],"binary":[125],"having":[127],"hulls":[129],"can":[135],"be":[136],"decided":[137],"in":[138],"few":[140],"minutes":[141],"for":[142],"lengths":[143],"50,":[146],"000.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-05-09T00:00:00"}