{"id":"https://openalex.org/W2143581582","doi":"https://doi.org/10.1109/isit.2010.5513658","title":"On the classification of self-dual additive codes over GF(9)","display_name":"On the classification of self-dual additive codes over GF(9)","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2143581582","doi":"https://doi.org/10.1109/isit.2010.5513658","mag":"2143581582"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513658","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078793078","display_name":"Lars Eirik Danielsen","orcid":"https://orcid.org/0000-0002-5141-0531"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Lars Eirik Danielsen","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway","Department of Informatics, University of Bergen, N-5020, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078793078"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14884172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"45","issue":null,"first_page":"1188","last_page":"1192"},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9958000183105469,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9932000041007996,"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/graph-isomorphism","display_name":"Graph isomorphism","score":0.561094343662262},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5373607277870178},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4740716516971588},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.46537086367607117},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45529723167419434},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4343973398208618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34098905324935913},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2607317566871643}],"concepts":[{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.561094343662262},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5373607277870178},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4740716516971588},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.46537086367607117},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45529723167419434},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4343973398208618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34098905324935913},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2607317566871643},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2010.5513658","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.189.4564","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.4564","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/%7Elarsed/isit-gf9selfdual.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1606879738","https://openalex.org/W1645988620","https://openalex.org/W1817326336","https://openalex.org/W1964589141","https://openalex.org/W2114436764","https://openalex.org/W2123849728","https://openalex.org/W2128751442","https://openalex.org/W2141424941","https://openalex.org/W2164713002","https://openalex.org/W2165148883","https://openalex.org/W2167413626","https://openalex.org/W2572379384","https://openalex.org/W2608977424","https://openalex.org/W3105797017","https://openalex.org/W6638655328"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1258892498","https://openalex.org/W1522618089","https://openalex.org/W2905073546","https://openalex.org/W3080158623","https://openalex.org/W4360838296","https://openalex.org/W2187958446","https://openalex.org/W1856194915","https://openalex.org/W2389075355","https://openalex.org/W2494517118"],"abstract_inverted_index":{"Additive":[0],"codes":[1,27],"over":[2],"GF(9)":[3],"that":[4,39,55,73],"are":[5,33],"self-dual":[6,57],"with":[7],"respect":[8],"to":[9,20,63],"the":[10,47,53,75],"Hermitian":[11],"trace":[12],"inner":[13],"product":[14],"have":[15],"previously":[16],"been":[17],"classified":[18],"up":[19],"length":[21,29],"8.":[22],"In":[23],"this":[24],"paper,":[25],"all":[26],"of":[28,44,77,83],"9":[30],"and":[31],"10":[32],"classified,":[34],"using":[35],"a":[36,64,68,81],"new":[37],"algorithm":[38],"combines":[40],"two":[41],"graph":[42,70,84],"representations":[43],"codes.":[45],"First,":[46],"search":[48],"space":[49],"is":[50,71],"reduced":[51],"by":[52],"fact":[54],"every":[56],"additive":[58],"code":[59,78],"can":[60],"be":[61],"mapped":[62],"weighted":[65],"graph.":[66],"Then":[67],"different":[69],"described":[72],"transforms":[74],"problem":[76,82],"equivalence":[79],"into":[80],"isomorphism.":[85]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}