{"id":"https://openalex.org/W3160733293","doi":"https://doi.org/10.1109/itw48936.2021.9611444","title":"The Typical Non-Linear Code over Large Alphabets","display_name":"The Typical Non-Linear Code over Large Alphabets","publication_year":2021,"publication_date":"2021-10-17","ids":{"openalex":"https://openalex.org/W3160733293","doi":"https://doi.org/10.1109/itw48936.2021.9611444","mag":"3160733293"},"language":"en","primary_location":{"id":"doi:10.1109/itw48936.2021.9611444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw48936.2021.9611444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/a00641bf-b644-4007-ab6c-a0dc28f69881","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075442918","display_name":"Anina Gruica","orcid":"https://orcid.org/0009-0008-3066-3223"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Anina Gruica","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025356502","display_name":"Alberto Ravagnani","orcid":"https://orcid.org/0000-0001-5901-9484"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alberto Ravagnani","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, the Netherlands","Eindhoven University of Technology, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075442918"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05809538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"117","issue":null,"first_page":"1","last_page":"6"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9997000098228455,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.7441014051437378},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6903424263000488},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6679728627204895},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6636135578155518},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6528128981590271},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6033130288124084},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6000601649284363},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.5659782290458679},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5293399095535278},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5140541791915894},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47964245080947876},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.46860846877098083},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.4510270953178406},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4307054281234741},{"id":"https://openalex.org/keywords/hamming","display_name":"Hamming(7,4)","score":0.42724713683128357},{"id":"https://openalex.org/keywords/dual-code","display_name":"Dual code","score":0.42357560992240906},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.39547228813171387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30721166729927063},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18844106793403625},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.10269823670387268}],"concepts":[{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.7441014051437378},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6903424263000488},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6679728627204895},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6636135578155518},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6528128981590271},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6033130288124084},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6000601649284363},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.5659782290458679},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5293399095535278},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5140541791915894},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47964245080947876},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.46860846877098083},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.4510270953178406},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4307054281234741},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.42724713683128357},{"id":"https://openalex.org/C73666251","wikidata":"https://www.wikidata.org/wiki/Q5310189","display_name":"Dual code","level":5,"score":0.42357560992240906},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.39547228813171387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30721166729927063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18844106793403625},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.10269823670387268},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/itw48936.2021.9611444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw48936.2021.9611444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire/a00641bf-b644-4007-ab6c-a0dc28f69881","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a00641bf-b644-4007-ab6c-a0dc28f69881","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gruica, A & Ravagnani, A 2021, The Typical Non-Linear Code over Large Alphabets. in 2021 IEEE Information Theory Workshop, ITW 2021., 9611444, Institute of Electrical and Electronics Engineers, 2021 IEEE Information Theory Workshop, ITW 2021, Virtual, Online, Japan, 17/10/21. https://doi.org/10.1109/ITW48936.2021.9611444","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2105.04378","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.04378","pdf_url":"https://arxiv.org/pdf/2105.04378","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3160733293","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2105.04378.pdf","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2105.04378","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2105.04378","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/a00641bf-b644-4007-ab6c-a0dc28f69881","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a00641bf-b644-4007-ab6c-a0dc28f69881","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gruica, A & Ravagnani, A 2021, The Typical Non-Linear Code over Large Alphabets. in 2021 IEEE Information Theory Workshop, ITW 2021., 9611444, Institute of Electrical and Electronics Engineers, 2021 IEEE Information Theory Workshop, ITW 2021, Virtual, Online, Japan, 17/10/21. https://doi.org/10.1109/ITW48936.2021.9611444","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1681793210","display_name":null,"funder_award_id":"KLEIN","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G5618363122","display_name":null,"funder_award_id":"VI.Vidi.203.045","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1537675645","https://openalex.org/W1568510176","https://openalex.org/W1606480398","https://openalex.org/W2014944833","https://openalex.org/W2050687505","https://openalex.org/W2085581636","https://openalex.org/W2095418648","https://openalex.org/W2096667287","https://openalex.org/W2139416652","https://openalex.org/W2167266655","https://openalex.org/W3080701381","https://openalex.org/W3096146904","https://openalex.org/W6784871999"],"related_works":["https://openalex.org/W2536817730","https://openalex.org/W2598916731","https://openalex.org/W1554098076","https://openalex.org/W2111721896","https://openalex.org/W3088602358","https://openalex.org/W2964022393","https://openalex.org/W2743327613","https://openalex.org/W2964009544","https://openalex.org/W2155925529","https://openalex.org/W2999794859","https://openalex.org/W3136820369","https://openalex.org/W2914227629","https://openalex.org/W2135699113","https://openalex.org/W2618234682","https://openalex.org/W2183449570","https://openalex.org/W3109040788","https://openalex.org/W1543977106","https://openalex.org/W2101996333","https://openalex.org/W2444031955","https://openalex.org/W2902053917"],"abstract_inverted_index":{"We":[0,21,73,99],"consider":[1],"the":[2,6,27,35,42,51,56,80,91,102,109,117],"problem":[3],"of":[4,11,44,59,83,93,119],"describing":[5],"typical":[7,52],"(possibly)":[8],"non-linear":[9,53],"code":[10,54],"minimum":[12,66],"distance":[13,67,88],"bounded":[14],"from":[15,64,70],"below":[16],"over":[17],"a":[18,96],"large":[19],"alphabet.":[20],"concentrate":[22],"on":[23,31],"block":[24,46,84],"codes":[25,33,85,94,107],"with":[26,34,41,86,108],"Hamming":[28,57],"metric":[29,58],"and":[30],"subspace":[32,106],"injection":[36,110],"metric.":[37],"In":[38],"sharp":[39],"contrast":[40],"behavior":[43],"linear":[45],"codes,":[47],"we":[48],"show":[49],"that":[50],"in":[55,122],"cardinality":[60],"$q^{n-d+1}$":[61],"is":[62],"far":[63],"having":[65,95],"d,":[68],"i.e.,":[69],"being":[71],"MDS.":[72],"also":[74,113],"give":[75],"more":[76],"precise":[77],"results":[78,104],"about":[79],"asymptotic":[81],"proportion":[82],"good":[87],"properties":[89],"within":[90],"set":[92],"certain":[97],"cardinality.":[98],"then":[100],"establish":[101],"analogous":[103],"for":[105],"metric,":[111],"showing":[112],"an":[114],"application":[115],"to":[116],"theory":[118],"partial":[120],"spreads":[121],"finite":[123],"geometry.":[124]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}