{"id":"https://openalex.org/W4415368147","doi":"https://doi.org/10.1109/isit63088.2025.11195340","title":"On the Theory of $\\mathbb{Z}_{m}$ Linear Codes: the $\\mathbb{Z}_{m}$ Linear Preparata and Goethals Codes for $m&gt;2$ *","display_name":"On the Theory of $\\mathbb{Z}_{m}$ Linear Codes: the $\\mathbb{Z}_{m}$ Linear Preparata and Goethals Codes for $m&gt;2$ *","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368147","doi":"https://doi.org/10.1109/isit63088.2025.11195340"},"language":"en","primary_location":{"id":"doi:10.1109/isit63088.2025.11195340","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5002622368","display_name":"Luca G. Tallini","orcid":"https://orcid.org/0000-0003-4238-173X"},"institutions":[{"id":"https://openalex.org/I124326101","display_name":"University of Teramo","ror":"https://ror.org/01yetye73","country_code":"IT","type":"education","lineage":["https://openalex.org/I124326101"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Luca G. Tallini","raw_affiliation_strings":["Universit&#x00E0; degli Studi di Teramo,Facolt&#x00E0; di Scienze della Comunicazione,Teramo,Italy"],"affiliations":[{"raw_affiliation_string":"Universit&#x00E0; degli Studi di Teramo,Facolt&#x00E0; di Scienze della Comunicazione,Teramo,Italy","institution_ids":["https://openalex.org/I124326101"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108277072","display_name":"Bella Bose","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bella Bose","raw_affiliation_strings":["Oregon State University,School of EECS,Corvallis,OR,USA"],"affiliations":[{"raw_affiliation_string":"Oregon State University,School of EECS,Corvallis,OR,USA","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002622368"],"corresponding_institution_ids":["https://openalex.org/I124326101"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15431455,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"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":0.9988999962806702,"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.9988999962806702,"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.9947999715805054,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9800999760627747,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6424999833106995},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5885000228881836},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5512999892234802},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.48980000615119934},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48339998722076416},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43209999799728394},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.4034999907016754}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7156999707221985},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6704000234603882},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6424999833106995},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5885000228881836},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5512999892234802},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5335999727249146},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.48980000615119934},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48339998722076416},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43209999799728394},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.4034999907016754},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.38940000534057617},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.33649998903274536},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.33320000767707825},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.260699987411499}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit63088.2025.11195340","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:research.unite.it:11575/169640","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/document/11195340","pdf_url":null,"source":{"id":"https://openalex.org/S4306401171","display_name":"UniTERAMO Research Catalog (University of Teramo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124326101","host_organization_name":"University of Teramo","host_organization_lineage":["https://openalex.org/I124326101"],"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":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7553878850","display_name":null,"funder_award_id":"CCF-2417898","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1990709045","https://openalex.org/W2018175171","https://openalex.org/W2035898047","https://openalex.org/W2038681062","https://openalex.org/W2039135323","https://openalex.org/W2096337439","https://openalex.org/W2096408325","https://openalex.org/W2125191148","https://openalex.org/W2147555059","https://openalex.org/W2162324316","https://openalex.org/W2171843169","https://openalex.org/W2241142163","https://openalex.org/W2613459457","https://openalex.org/W2783382162","https://openalex.org/W2885361674","https://openalex.org/W2895239415","https://openalex.org/W2953546776","https://openalex.org/W2962685383","https://openalex.org/W3207410021","https://openalex.org/W4250392212","https://openalex.org/W4251178606","https://openalex.org/W4255297036","https://openalex.org/W4294312843","https://openalex.org/W4386057556","https://openalex.org/W4401693283"],"related_works":[],"abstract_inverted_index":{"Let":[0],"<tex":[1,7,18,23,31,42,62,69,74,128,139,146,154,158,167,175,184,197,207,215,224,249,266],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[2,8,19,24,32,43,63,70,75,129,140,147,155,159,168,176,185,198,208,216,225,250,267],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m":[3],"\\in":[4,34,143,161,203],"\\mathbb{N}$</tex>":[5,35,144],"and":[6,133,157,182,222,245],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{Z}_{m}":[9],"\\stackrel{\\text":[10],"{":[11],"def":[12],"}}{=}\\{0,1,":[13],"\\ldots,":[14],"m-1\\}$</tex>":[15],"be":[16],"the":[17,40,58,86,117,127,137,165,194,205,254,262],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m$</tex>":[20],"ary":[21],"alphabet.":[22],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbf{A}":[25],"\\mathbb{Z}_{m}$</tex>":[26],"linear":[27,72,131,170,210,274],"code":[28,73],"of":[29,39,67,89,105,111,119,124,240,270],"length":[30,174,214],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n":[33],"is":[36],"a":[37,53,81],"submodule":[38],"module":[41],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\left(\\mathbb{Z}_{m}^{n},+\\bmod":[44],"m,":[45],"\\mathbb{Z}_{m},":[46],"\\cdot":[47],"\\bmod":[48],"m\\right)$</tex>.":[49],"This":[50,77],"paper":[51],"presents":[52],"significant":[54],"lower":[55],"bound":[56,78],"for":[57,80,152],"minimum":[59,83,178,218,256],"Lee":[60,84,179,219,257],"distance":[61,180,220],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d_{\\text":[64],"{Lee":[65],"}}(\\mathcal{C})$</tex>,":[66],"any":[68,153],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{Z}_{m}$</tex>":[71,169,209],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathcal{C}$</tex>.":[76],"facilitates,":[79],"given":[82],"distance,":[85],"efficient":[87],"design":[88],"high":[90],"information":[91],"rate":[92],"codes,":[93],"which":[94],"are":[95,114,242],"computationally":[96],"simple":[97],"to":[98,265],"implement":[99],"using":[100],"algebraic":[101],"operations":[102],"over":[103,136],"fields":[104],"small":[106],"cardinality.":[107],"Two":[108],"notable":[109],"examples":[110],"such":[112],"codes":[113,125,135,172,212,241,252],"provided,":[115],"demonstrating":[116],"application":[118],"this":[120],"bound.":[121],"These":[122],"families":[123,239],"generalize":[126],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{Z}_{4}$</tex>":[130],"Preparata":[132,171],"Goethals":[134,211],"alphabet":[138],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{Z}_{m},":[141],"m=2^{l}":[142],"with":[145,253],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$l":[148],"\\geq":[149],"2$</tex>.":[150],"Specifically,":[151],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m=2^{l}&gt;2$</tex>":[156],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$h":[160],"\\mathbb{N},":[162],"h$</tex>":[163],"odd,":[164],"generalized":[166,206],"have":[173,213],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n+1=2^{h}$</tex>,":[177,217],"6":[181],"cardinality":[183,223],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$|\\mathcal{C}|=m^{n-h-1}\\lceil":[186],"m":[187,190,228,231,234],"/":[188,191,229,232,235],"4\\rceil^{h}\\lceil":[189,233],"8\\rceil$</tex>.":[192,236],"For":[193],"same":[195,255],"parameters":[196],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m,":[199],"l,":[200],"n,":[201],"h":[202],"\\mathbb{N}$</tex>,":[204],"8":[221],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$|\\mathcal{C}|=m^{n-2":[226],"h-1}\\lceil":[227],"2\\rceil^{h}\\lceil":[230],"Notably,":[237],"both":[238],"less":[243,246],"redundant":[244],"complex":[247],"than":[248],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m$</tex>-ary":[251],"distances":[258],"obtained":[259],"by":[260],"applying":[261],"Gray":[263],"mapping":[264],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$l$</tex>-bit":[268],"subblocks":[269],"codewords":[271],"from":[272],"binary":[273],"codes.":[275]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}