{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:11Z","timestamp":1773376991661,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2417898"],"award-info":[{"award-number":["CCF-2417898"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195340","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["On the Theory of $\\mathbb{Z}_{m}$ Linear Codes: the $\\mathbb{Z}_{m}$ Linear Preparata and Goethals Codes for $m>2$ *"],"prefix":"10.1109","author":[{"given":"Luca G.","family":"Tallini","sequence":"first","affiliation":[{"name":"Università degli Studi di Teramo,Facoltà di Scienze della Comunicazione,Teramo,Italy"}]},{"given":"Bella","family":"Bose","sequence":"additional","affiliation":[{"name":"Oregon State University,School of EECS,Corvallis,OR,USA"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Algebraic Coding Theory - Revised 1984 Edition","author":"Berlekamp","year":"1984"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511543401"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/isit.1998.708796"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9323-8_3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2703171"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2012.6176524"},{"issue":"1","key":"ref7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01390768","article-title":"Modular and $p$-adic cyclic codes","volume":"6","author":"Calderbank","year":"1995","journal-title":"Designs, Codes and Cryptography"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040971"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.904501"},{"key":"ref10","volume-title":"Bounds on the minimum distance of linear codes and quantum codes","author":"Grassl"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2603658"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2019.06.015"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.312154"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.33232\/BIMS.0047.15.22"},{"key":"ref15","volume-title":"MinT - the online database for optimal parameters of (t, m, s)-nets, (t, s) -sequences, orthogonal arrays, linear codes, and OOAs"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791990"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619517"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206630"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3203594"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437336"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620315"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284657"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284658"},{"key":"ref25","first-page":"1026","article-title":"On $L_{1}$-distance error control codes","volume-title":"2011 IEEE International Symposium on Information Theory (ISIT)","author":"Tallini"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033691"},{"key":"ref27","first-page":"265","article-title":"On decoding some error control codes using the elementary symmetric functions","volume-title":"Trends in Incidence and Galois Geometries: a Tribute to Giuseppe Tallini - Quaderni di Matematica","volume":"19","author":"Tallini","year":"2010"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513741"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595133"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/12.165401"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195340.pdf?arnumber=11195340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:50Z","timestamp":1773347390000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195340\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195340","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}