{"id":"https://openalex.org/W2160827057","doi":"https://doi.org/10.1109/tit.2009.2030484","title":"On the Minimal Distance of Binary Self-Dual Cyclic Codes","display_name":"On the Minimal Distance of Binary Self-Dual Cyclic Codes","publication_year":2009,"publication_date":"2009-10-27","ids":{"openalex":"https://openalex.org/W2160827057","doi":"https://doi.org/10.1109/tit.2009.2030484","mag":"2160827057"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2009.2030484","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2030484","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.rug.nl/files/2636201/2009IEEETransInfTheoryHeijne.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058090987","display_name":"Bas Heijne","orcid":null},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bas Heijne","raw_affiliation_strings":["Department of Mathematics and Computer Science (IWI), University of Groningam, Groningen, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science (IWI), University of Groningam, Groningen, Netherlands","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085656367","display_name":"Jaap Top","orcid":"https://orcid.org/0000-0002-5265-7608"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jaap Top","raw_affiliation_strings":["Department of Mathematics and Computer Science (IWI), University of Groningam, Groningen, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science (IWI), University of Groningam, Groningen, Netherlands","institution_ids":["https://openalex.org/I169381384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I169381384"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":0.5348,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.80269132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"55","issue":"11","first_page":"4860","last_page":"4863"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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.9955000281333923,"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/T10849","display_name":"Finite Group Theory Research","score":0.992900013923645,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.7370517253875732},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.6216294765472412},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6117988228797913},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5559372305870056},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5443929433822632},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5254805684089661},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5197281837463379},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5059968829154968},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33422011137008667},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1565045714378357}],"concepts":[{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.7370517253875732},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6216294765472412},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6117988228797913},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5559372305870056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5443929433822632},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5254805684089661},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5197281837463379},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5059968829154968},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33422011137008667},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1565045714378357},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tit.2009.2030484","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2030484","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:publications/23e56817-0671-4daf-9097-5ea9f4487784","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/23e56817-0671-4daf-9097-5ea9f4487784","pdf_url":"https://research.rug.nl/files/2636201/2009IEEETransInfTheoryHeijne.pdf","source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Heijne, B & Top, J 2009, 'On the Minimal Distance of Binary Self-Dual Cyclic Codes', IEEE Transactions on Information Theory, vol. 55, no. 11, pp. 4860-4863. https://doi.org/10.1109/TIT.2009.2030484","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.157.9295","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.9295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.rug.nl/~top/metbasIEEE.pdf","raw_type":"text"},{"id":"pmh:oai:pure.rug.nl:openaire/23e56817-0671-4daf-9097-5ea9f4487784","is_oa":true,"landing_page_url":"https://hdl.handle.net/11370/23e56817-0671-4daf-9097-5ea9f4487784","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"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":"Heijne, B & Top, J 2009, 'On the Minimal Distance of Binary Self-Dual Cyclic Codes', IEEE Transactions on Information Theory, vol. 55, no. 11, pp. 4860-4863. https://doi.org/10.1109/TIT.2009.2030484","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.rug.nl:publications/23e56817-0671-4daf-9097-5ea9f4487784","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/23e56817-0671-4daf-9097-5ea9f4487784","pdf_url":"https://research.rug.nl/files/2636201/2009IEEETransInfTheoryHeijne.pdf","source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Heijne, B & Top, J 2009, 'On the Minimal Distance of Binary Self-Dual Cyclic Codes', IEEE Transactions on Information Theory, vol. 55, no. 11, pp. 4860-4863. https://doi.org/10.1109/TIT.2009.2030484","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2160827057.pdf","grobid_xml":"https://content.openalex.org/works/W2160827057.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1556443961","https://openalex.org/W1559343931","https://openalex.org/W1603089898","https://openalex.org/W1617868970","https://openalex.org/W1963661276","https://openalex.org/W1975982897","https://openalex.org/W2039343706","https://openalex.org/W2061721328","https://openalex.org/W2068699755","https://openalex.org/W2078830190","https://openalex.org/W2091968255","https://openalex.org/W2102759336","https://openalex.org/W2137476296","https://openalex.org/W2155630979","https://openalex.org/W2161496548","https://openalex.org/W2895335898","https://openalex.org/W4206482926","https://openalex.org/W4206775542"],"related_works":["https://openalex.org/W2115275536","https://openalex.org/W2019417807","https://openalex.org/W1986045152","https://openalex.org/W1996178875","https://openalex.org/W3046379320","https://openalex.org/W2171635774","https://openalex.org/W2508005517","https://openalex.org/W1991401790","https://openalex.org/W2056125990","https://openalex.org/W1513684005"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"an":[3,67],"explicit":[4],"construction":[5],"of":[6,11,50,57,73],"binary":[7,37,74],"self-dual":[8,51,75],"cyclic":[9,38,52],"codes":[10,39],"lengthngoing":[12],"to":[13,33],"infinity":[14],"with":[15,40],"a":[16,41,54,58],"minimal":[17,43],"distance":[18,72],"at":[19],"least":[20],"half":[21],"the":[22,47,71],"square":[23],"root":[24],"ofnis":[25],"presented.":[26],"The":[27],"same":[28],"idea":[29],"is":[30,64],"also":[31],"used":[32],"construct":[34],"more":[35],"general":[36],"large":[42],"distance.":[44],"Finally,":[45],"in":[46],"special":[48],"case":[49],"codes,":[53],"simplified":[55],"version":[56],"proof":[59],"by":[60],"Conway":[61],"and":[62],"Sloane":[63],"given,":[65],"showing":[66],"upper":[68],"bound":[69],"for":[70],"codes.":[76]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}