{"id":"https://openalex.org/W3004650230","doi":"https://doi.org/10.37236/8040","title":"","display_name":"","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3004650230","doi":"https://doi.org/10.37236/8040","mag":"3004650230"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire/1055714d-e16e-40e3-9934-d5ea83e6ffe1","is_oa":false,"landing_page_url":"https://admin.research-repository.uwa.edu.au/en/publications/1055714d-e16e-40e3-9934-d5ea83e6ffe1","pdf_url":null,"source":{"id":"https://openalex.org/S4306402492","display_name":"UWA Profiles and Research Repository (UWA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gillespie, N I, Hawtin, D R & Praeger, C E 2020, '2-neighbour-transitive codes with small blocks of imprimitivity \u2217', Electronic Journal of Combinatorics, vol. 27, no. 1, P1.42. https://doi.org/10.37236/8040","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/en/publications/10210b15-9a33-4ce3-b677-19e207fe512d","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015476737","display_name":"Neil I. Gillespie","orcid":"https://orcid.org/0009-0006-9237-0042"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gillespie, Neil I.","raw_affiliation_strings":["University of Bristol"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bristol","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020839496","display_name":"Daniel R. Hawtin","orcid":"https://orcid.org/0000-0002-6466-4282"},"institutions":[{"id":"https://openalex.org/I130438778","display_name":"Memorial University of Newfoundland","ror":"https://ror.org/04haebc03","country_code":"CA","type":"education","lineage":["https://openalex.org/I130438778"]},{"id":"https://openalex.org/I154347574","display_name":"University of Rijeka","ror":"https://ror.org/05r8dqr10","country_code":"HR","type":"education","lineage":["https://openalex.org/I154347574"]}],"countries":["CA","HR"],"is_corresponding":false,"raw_author_name":"Hawtin, Daniel R.","raw_affiliation_strings":["Memorial University of Newfoundland","University of Rijeka","Memorial University of Newfoundland, Grenfell Campus"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Memorial University of Newfoundland","institution_ids":["https://openalex.org/I130438778"]},{"raw_affiliation_string":"University of Rijeka","institution_ids":["https://openalex.org/I154347574"]},{"raw_affiliation_string":"Memorial University of Newfoundland, Grenfell Campus","institution_ids":["https://openalex.org/I130438778"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043525348","display_name":"Cheryl E. Praeger","orcid":"https://orcid.org/0000-0002-0881-7336"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Praeger, Cheryl E.; id_orcid 0000-0002-0881-7336","raw_affiliation_strings":["Mathematics and Statistics","The University of Western Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics and Statistics","institution_ids":[]},{"raw_affiliation_string":"The University of Western Australia","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9987999796867371,"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.9987999796867371,"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.9904999732971191,"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/T11567","display_name":"semigroups and automata theory","score":0.9722999930381775,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/combinatorics","display_name":"Combinatorics","score":0.8215391635894775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8040362000465393},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.779634416103363},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.6290247440338135},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.5562015771865845},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47286152839660645},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.47279542684555054},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.46604597568511963},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.44151073694229126},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.4224027395248413},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.4128720164299011},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17113569378852844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11390671133995056},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.09685516357421875},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.08412641286849976}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8215391635894775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8040362000465393},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.779634416103363},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.6290247440338135},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.5562015771865845},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47286152839660645},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.47279542684555054},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.46604597568511963},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.44151073694229126},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.4224027395248413},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.4128720164299011},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17113569378852844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11390671133995056},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.09685516357421875},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.08412641286849976},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire/1055714d-e16e-40e3-9934-d5ea83e6ffe1","is_oa":false,"landing_page_url":"https://admin.research-repository.uwa.edu.au/en/publications/1055714d-e16e-40e3-9934-d5ea83e6ffe1","pdf_url":null,"source":{"id":"https://openalex.org/S4306402492","display_name":"UWA Profiles and Research Repository (UWA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gillespie, N I, Hawtin, D R & Praeger, C E 2020, '2-neighbour-transitive codes with small blocks of imprimitivity \u2217', Electronic Journal of Combinatorics, vol. 27, no. 1, P1.42. https://doi.org/10.37236/8040","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/10210b15-9a33-4ce3-b677-19e207fe512d","is_oa":true,"landing_page_url":null,"pdf_url":"https://research-information.bris.ac.uk/en/publications/10210b15-9a33-4ce3-b677-19e207fe512d","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.atira.dk:publications/1055714d-e16e-40e3-9934-d5ea83e6ffe1","is_oa":true,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/1055714d-e16e-40e3-9934-d5ea83e6ffe1","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gillespie, N I, Hawtin, D R & Praeger, C E 2020, '2-neighbour-transitive codes with small blocks of imprimitivity \u2217', Electronic Journal of Combinatorics, vol. 27, no. 1, P1.42. https://doi.org/10.37236/8040","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:publications/10210b15-9a33-4ce3-b677-19e207fe512d","is_oa":true,"landing_page_url":null,"pdf_url":"https://research-information.bris.ac.uk/en/publications/10210b15-9a33-4ce3-b677-19e207fe512d","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6800000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3004650230.pdf","grobid_xml":"https://content.openalex.org/works/W3004650230.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W109405981","https://openalex.org/W1493955979","https://openalex.org/W1535858642","https://openalex.org/W1606480398","https://openalex.org/W1980534096","https://openalex.org/W1997418629","https://openalex.org/W1999414075","https://openalex.org/W2009956376","https://openalex.org/W2015654207","https://openalex.org/W2017838453","https://openalex.org/W2018380381","https://openalex.org/W2029062209","https://openalex.org/W2043888621","https://openalex.org/W2102248357","https://openalex.org/W2109517477","https://openalex.org/W2130234052","https://openalex.org/W2154746932","https://openalex.org/W2165950086","https://openalex.org/W2327942867","https://openalex.org/W2496604268","https://openalex.org/W2517125873","https://openalex.org/W2587392622","https://openalex.org/W2599600651","https://openalex.org/W2783228930","https://openalex.org/W2963024133","https://openalex.org/W3103213953","https://openalex.org/W4247708292","https://openalex.org/W4298236575"],"related_works":["https://openalex.org/W2083881167","https://openalex.org/W2018380381","https://openalex.org/W2009956376","https://openalex.org/W2950325774","https://openalex.org/W4299963183","https://openalex.org/W2810042661","https://openalex.org/W2102248357","https://openalex.org/W4298168626","https://openalex.org/W3112466775","https://openalex.org/W3004650230"],"abstract_inverted_index":{"A":[0],"code":[1,30],"C":[2,25,31,36,42,83,89,93,101],"in":[3],"the":[4,14,19,22,49,53,57],"Hamming":[5,20],"graph":[6],"=":[7],"H(m,":[8],"q)":[9],"is":[10,48,61,77,94,102],"a":[11,33],"subset":[12],"of":[13,18,24,44,52,81],"vertex":[15,60],"set":[16],"V":[17,45],"graph;":[21],"elements":[23],"are":[26],"called":[27],"codewords.Any":[28],"such":[29],"induces":[32],"partition":[34],"{C,":[35],"1":[37,84],",":[38,46,85,91],".":[39,40,68,69,86,87],".,":[41,70,88],"}":[43,71],"where":[47],"covering":[50],"radius":[51],"code,":[54],"based":[55],"on":[56,79],"distance":[58],"each":[59,80],"to":[62,96,104],"its":[63],"nearest":[64],"codeword.For":[65],"s":[66,90],"{1,":[67],"and":[72],"X":[73,76],"Aut(C),":[74],"if":[75,108],"transitive":[78,107],"C,":[82],"then":[92],"said":[95,103],"be":[97,105],"(X,":[98],"s)neighbour-transitive.In":[99],"particular,":[100],"X-completely":[106]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2025-10-10T00:00:00"}