{"id":"https://openalex.org/W157860002","doi":null,"title":"A polynomial algorithm for codes based on directed graphs","display_name":"A polynomial algorithm for codes based on directed graphs","publication_year":2006,"publication_date":"2006-01-16","ids":{"openalex":"https://openalex.org/W157860002","mag":"157860002"},"language":"en","primary_location":{"id":"pmh:oai:ecite.utas.edu.au:39566","doi":null,"is_oa":false,"landing_page_url":"http://ecite.utas.edu.au/39566","pdf_url":null,"source":{"id":"https://openalex.org/S4306401569","display_name":"eCite Digital Repository (University of Tasmania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I129801699","host_organization_name":"University of Tasmania","host_organization_lineage":["https://openalex.org/I129801699"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Refereed Conference Paper"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5013103385","display_name":"Andrei V. Kelarev","orcid":"https://orcid.org/0000-0001-9402-3534","observed_orcids":["https://orcid.org/0000-0001-9402-3534"]},"institutions":[{"id":"https://openalex.org/I129801699","display_name":"University of Tasmania","ror":"https://ror.org/01nfmeh72","country_code":"AU","type":"education","lineage":["https://openalex.org/I129801699"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Andrei Kelarev","raw_affiliation_strings":["University of Tasmania,Hobart,Tasmania,Australia"],"raw_orcid":"https://orcid.org/0000-0001-9402-3534","affiliations":[{"raw_affiliation_string":"University of Tasmania,Hobart,Tasmania,Australia","institution_ids":["https://openalex.org/I129801699"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013103385"],"corresponding_institution_ids":["https://openalex.org/I129801699"],"apc_list":null,"apc_paid":null,"fwci":0.785,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63382353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":null,"first_page":"87","last_page":"92"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.00039999998989515007,"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"}},{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.8399999737739563},{"id":"https://openalex.org/keywords/cyclic-codes","display_name":"cyclic codes","score":0.8870000243186951},{"id":"https://openalex.org/keywords/error-correcting-codes","display_name":"error-correcting codes","score":0.7440000176429749},{"id":"https://openalex.org/keywords/generator-polynomials","display_name":"generator polynomials","score":0.546999990940094}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6867661476135254},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5219640135765076},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4809695780277252},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43205076456069946},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4296693801879883},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.4113045930862427},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.38333672285079956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37395554780960083},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.35483598709106445},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34094300866127014},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31408530473709106},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:ecite.utas.edu.au:39566","doi":null,"is_oa":false,"landing_page_url":"http://ecite.utas.edu.au/39566","pdf_url":null,"source":{"id":"https://openalex.org/S4306401569","display_name":"eCite Digital Repository (University of Tasmania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I129801699","host_organization_name":"University of Tasmania","host_organization_lineage":["https://openalex.org/I129801699"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Refereed Conference Paper"},{"id":"pmh:oai:figshare.com:article/23083460","doi":null,"is_oa":false,"landing_page_url":"https://figshare.com/articles/conference_contribution/A_Polynomial_Algorithm_for_Codes_Based_on_Directed_Graphs/23083460","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"},{"id":"mag:157860002","doi":null,"is_oa":false,"landing_page_url":"http://ecite.utas.edu.au/39566/","pdf_url":null,"source":{"id":"https://openalex.org/S4306417993","display_name":"Computing: The Australasian Theory Symposium","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computing: The Australasian Theory Symposium","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W11677679","https://openalex.org/W215178276","https://openalex.org/W301824129","https://openalex.org/W1471103927","https://openalex.org/W1537803653","https://openalex.org/W1556443961","https://openalex.org/W1569205584","https://openalex.org/W1569612250","https://openalex.org/W1963871092","https://openalex.org/W1989538312","https://openalex.org/W2017758698","https://openalex.org/W2130499665","https://openalex.org/W2204722887","https://openalex.org/W2249179541","https://openalex.org/W2280438456","https://openalex.org/W2752885492","https://openalex.org/W2913688336","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W2141385410","https://openalex.org/W7098749531","https://openalex.org/W2601269560","https://openalex.org/W4293196297","https://openalex.org/W2046707140","https://openalex.org/W1493040629","https://openalex.org/W2000056635","https://openalex.org/W1435936556","https://openalex.org/W2566148463","https://openalex.org/W4308913517"],"abstract_inverted_index":{"A":[0],"complete":[1],"description":[2],"and":[3,24],"proof":[4],"of":[5,18,48,93,111],"correctness":[6],"are":[7,63],"given":[8],"for":[9,15],"a":[10,16,66,109,112],"new":[11],"polynomial":[12,70],"time":[13],"algorithm":[14,88],"class":[17],"codes":[19,49,61,77,100],"based":[20],"on":[21],"directed":[22],"graphs":[23],"involving":[25],"construction":[26,33,53],"well":[27],"known":[28],"in":[29,38,41,50,65,69,81],"system":[30],"theory.":[31],"Our":[32],"has":[34],"already":[35],"been":[36],"considered":[37],"the":[39,87,90],"literature":[40],"relation":[42],"to":[43],"other":[44],"questions.":[45],"The":[46],"investigation":[47],"this":[51,82,103,115],"graph-based":[52],"is":[54],"inspired":[55],"by":[56,99],"analogy":[57],"with":[58,102,114],"classical":[59],"cyclic":[60,76],"that":[62,74],"defined":[64,101],"similar":[67],"way":[68],"rings.":[71],"We":[72],"show":[73],"all":[75],"can":[78,96],"be":[79,97],"embedded":[80],"construction.":[83],"For":[84],"each":[85],"graph,":[86],"computes":[89],"largest":[91],"number":[92],"errors":[94],"which":[95],"corrected":[98],"graph.":[104],"In":[105],"addition,":[106],"it":[107],"finds":[108],"generator":[110],"code":[113],"optimum":[116],"value.":[117]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}