{"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>2$ *","display_name":"On the Theory of $\\mathbb{Z}_{m}$ Linear Codes: the $\\mathbb{Z}_{m}$ Linear Preparata and Goethals Codes for $m>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":"conference-paper","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":false,"raw_author_name":"Luca G. Tallini","raw_affiliation_strings":["Università degli Studi di Teramo,Facoltà di Scienze della Comunicazione,Teramo,Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Università degli Studi di Teramo,Facoltà 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"],"raw_orcid":null,"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":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25514159,"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/stamp/stamp.jsp?tp=&arnumber=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/G514819512","display_name":"CCF:SHF:Small: Some new classes of codes for computer and memory systems.","funder_award_id":"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":{"grobid_xml":false,"pdf":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$m":[0],"\\in":[1,15,103,110,138],"\\mathbb{N}$and$\\mathbb{Z}_{m}":[2],"\\stackrel{\\text":[3],"{":[4],"def":[5],"}}{=}\\{0,1,":[6],"\\ldots,":[7],"m-1\\}$be":[8],"the$m$ary":[9],"alphabet.$\\mathbf{A}":[10],"\\mathbb{Z}_{m}$linear":[11],"code":[12],"of":[13,19,41,56,72,78,86,91,165,189],"length$n":[14],"\\mathbb{N}$is":[16],"a":[17,30,48],"submodule":[18],"the":[20,35,53,84,100,113,132,140,176,184],"module$\\left(\\mathbb{Z}_{m}^{n},+\\bmod":[21],"m,":[22],"\\mathbb{Z}_{m},":[23],"\\cdot":[24],"\\bmod":[25],"m\\right)$.":[26],"This":[27,44],"paper":[28],"presents":[29],"significant":[31],"lower":[32],"bound":[33,45],"for":[34,47,108],"minimum":[36,50,119,146,178],"Lee":[37,51,120,147,179],"distance$d_{\\text":[38],"{Lee":[39],"}}(\\mathcal{C})$,":[40],"any$\\mathbb{Z}_{m}$linear":[42],"code$\\mathcal{C}$.":[43],"facilitates,":[46],"given":[49],"distance,":[52],"efficient":[54],"design":[55],"high":[57],"information":[58],"rate":[59],"codes,":[60],"which":[61],"are":[62,81,167],"computationally":[63],"simple":[64],"to":[65],"implement":[66],"using":[67],"algebraic":[68],"operations":[69],"over":[70,99],"fields":[71],"small":[73],"cardinality.":[74],"Two":[75],"notable":[76],"examples":[77],"such":[79],"codes":[80,92,98,116,143,166,174],"provided,":[82],"demonstrating":[83],"application":[85],"this":[87],"bound.":[88],"These":[89],"families":[90,164],"generalize":[93],"the$\\mathbb{Z}_{4}$linear":[94],"Preparata":[95,115],"and":[96,123,150,170],"Goethals":[97,142],"alphabet$\\mathbb{Z}_{m},":[101],"m=2^{l}":[102],"\\mathbb{N}$with$l":[104],"\\geq":[105],"2$.":[106],"Specifically,":[107],"any$m=2^{l}>2$and$h":[109],"\\mathbb{N},":[111],"h$odd,":[112],"generalized$\\mathbb{Z}_{m}$linear":[114,141],"have":[117,144],"length$n+1=2^{h}$,":[118,145],"distance":[121,148],"6":[122],"cardinality$|\\mathcal{C}|=m^{n-h-1}\\lceil":[124],"m":[125,128,153,156,159],"/":[126,129,154,157,160],"4\\rceil^{h}\\lceil":[127,158],"8\\rceil$.":[130,161],"For":[131],"same":[133,177],"parameters$m,":[134],"l,":[135],"n,":[136],"h":[137],"\\mathbb{N}$,":[139],"8":[149],"cardinality$|\\mathcal{C}|=m^{n-2":[151],"h-1}\\lceil":[152],"2\\rceil^{h}\\lceil":[155],"Notably,":[162],"both":[163],"less":[168,171],"redundant":[169],"complex":[172],"than$m$-ary":[173],"with":[175],"distances":[180],"obtained":[181],"by":[182],"applying":[183],"Gray":[185],"mapping":[186],"to$l$-bit":[187],"subblocks":[188],"codewords":[190],"from":[191],"binary":[192],"linear":[193],"codes.":[194]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-21T00:00:00"}