{"id":"https://openalex.org/W2615834080","doi":"https://doi.org/10.1007/s10623-017-0366-0","title":"New nonbinary code bounds based on divisibility arguments","display_name":"New nonbinary code bounds based on divisibility arguments","publication_year":2017,"publication_date":"2017-05-20","ids":{"openalex":"https://openalex.org/W2615834080","doi":"https://doi.org/10.1007/s10623-017-0366-0","mag":"2615834080","pmid":"https://pubmed.ncbi.nlm.nih.gov/31564771"},"language":"en","primary_location":{"id":"doi:10.1007/s10623-017-0366-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10623-017-0366-0","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10623-017-0366-0.pdf","source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs10623-017-0366-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sven C. Polak","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Sven C. Polak","raw_affiliation_strings":["Korteweg-De Vries Institute for Mathematics, University of Amsterdam, Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korteweg-De Vries Institute for Mathematics, University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.2079,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62624019,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"86","issue":"4","first_page":"861","last_page":"874"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.8766999840736389,"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.8766999840736389,"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.10080000013113022,"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.01209999993443489,"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/divisibility-rule","display_name":"Divisibility rule","score":0.8424999713897705},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7009000182151794},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5715000033378601},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5235999822616577},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.39160001277923584},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.31790000200271606}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.9115999937057495},{"id":"https://openalex.org/C9991821","wikidata":"https://www.wikidata.org/wiki/Q858520","display_name":"Divisibility rule","level":2,"score":0.8424999713897705},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7009000182151794},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5819000005722046},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5715000033378601},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5530999898910522},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5235999822616577},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.39160001277923584},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.31790000200271606},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.2840000092983246},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.26440000534057617}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/s10623-017-0366-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10623-017-0366-0","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10623-017-0366-0.pdf","source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},{"id":"pmid:31564771","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/31564771","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, codes, and cryptography","raw_type":null},{"id":"pmh:oai:arXiv.org:1606.05144","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1606.05144","pdf_url":"https://arxiv.org/pdf/1606.05144","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:dare.uva.nl:openaire/7bc9372c-fd97-44f2-94a3-deb560fb9b43","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/new-nonbinary-code-bounds-based-on-divisibility-arguments(7bc9372c-fd97-44f2-94a3-deb560fb9b43).html","pdf_url":"https://pure.uva.nl/ws/files/25847973/New_nonbinary_code.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Polak, S C 2018, 'New nonbinary code bounds based on divisibility arguments', Designs, Codes, and Cryptography, vol. 86, no. 4, pp. 861\u2013874. https://doi.org/10.1007/s10623-017-0366-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:cwi:oai:cwi.nl:30361","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/30361","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"Designs, Codes and Cryptography, 86, 861 - 874","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dare.uva.nl:publications/7bc9372c-fd97-44f2-94a3-deb560fb9b43","is_oa":true,"landing_page_url":"https://hdl.handle.net/11245.1/7bc9372c-fd97-44f2-94a3-deb560fb9b43","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Polak, S C 2018, 'New nonbinary code bounds based on divisibility arguments', Designs, Codes, and Cryptography, vol. 86, no. 4, pp. 861\u2013874. https://doi.org/10.1007/s10623-017-0366-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pubmedcentral.nih.gov:6743706","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/6743706","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Des Codes Cryptogr","raw_type":"Text"},{"id":"pmh:uvapub:oai:dare.uva.nl:openaire_cris_publications/7bc9372c-fd97-44f2-94a3-deb560fb9b43","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/new-nonbinary-code-bounds-based-on-divisibility-arguments(7bc9372c-fd97-44f2-94a3-deb560fb9b43).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"Designs, Codes, and Cryptography, 86(4). Springer Netherlands","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10623-017-0366-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10623-017-0366-0","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10623-017-0366-0.pdf","source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1997210176","display_name":null,"funder_award_id":"339109","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2615834080.pdf","grobid_xml":"https://content.openalex.org/works/W2615834080.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1989239007","https://openalex.org/W1997840831","https://openalex.org/W2039506975","https://openalex.org/W2094687892","https://openalex.org/W2152163113","https://openalex.org/W2267943254","https://openalex.org/W2546487582","https://openalex.org/W3122192503","https://openalex.org/W4233025094"],"related_works":[],"abstract_inverted_index":{"from":[0],"these":[1],"'symmetric":[2],"net'":[3],"codes.":[4]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2017-05-26T00:00:00"}