{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:21:06Z","timestamp":1759940466699,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including (sub)linear and nonlinear codes. We focus on the general setting of finite translation-invariant metric spaces, and then specialize our results to the Hamming metric, to the rank metric, and to the sum-rank metric. Our results show that the asymptotic density of codes heavily depends on the imposed linearity degree and the chosen metric.<\/jats:p>","DOI":"10.1007\/s10623-023-01236-2","type":"journal-article","created":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T15:01:40Z","timestamp":1685372500000},"page":"609-637","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Densities of codes of various linearity degrees in translation-invariant metric spaces"],"prefix":"10.1007","volume":"92","author":[{"given":"Anina","family":"Gruica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna-Lena","family":"Horlemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Ravagnani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3049-7268","authenticated-orcid":false,"given":"Nadja","family":"Willenborg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,29]]},"reference":[{"issue":"10","key":"1236_CR1","doi-asserted-by":"publisher","first-page":"6204","DOI":"10.1109\/TIT.2019.2926256","volume":"65","author":"J Antrobus","year":"2019","unstructured":"Antrobus J., Gluesing-Luerssen H.: Maximal Ferrers diagram codes: constructions and genericity considerations. IEEE Trans. Inf. Theory 65(10), 6204\u20136223 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1236_CR2","volume-title":"Introduction to Analytic Number Theory","author":"TM Apostol","year":"2013","unstructured":"Apostol T.M.: Introduction to Analytic Number Theory. Springer, New York (2013)."},{"key":"1236_CR3","unstructured":"Baldi M., Battaglioni M., Chiaraluce F., Horlemann-Trautmann A.-L., Persichetti E., Santini P., Weger V.: A new path to code-based signatures via identification schemes with restricted errors (2021)"},{"key":"1236_CR4","doi-asserted-by":"crossref","unstructured":"Ball S., Gamboa G., Lavrauw M.: On additive MDS codes over small fields. arXiv:2012.06183 (2020)","DOI":"10.3934\/amc.2021024"},{"issue":"9","key":"1236_CR5","doi-asserted-by":"publisher","first-page":"2568","DOI":"10.1109\/TIT.2002.800480","volume":"48","author":"A Barg","year":"2002","unstructured":"Barg A., Forney G.D.: Random codes: minimum distances and error exponents. IEEE Trans. Inf. Theory 48(9), 2568\u20132573 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1236_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.jcta.2019.105169","volume":"171","author":"E Byrne","year":"2020","unstructured":"Byrne E., Ravagnani A.: Partition-balanced families of codes and asymptotic enumeration in coding theory. J. Comb. Theory Ser. A 171, 105 (2020).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"10","key":"1236_CR7","doi-asserted-by":"publisher","first-page":"6456","DOI":"10.1109\/TIT.2021.3074190","volume":"67","author":"E Byrne","year":"2021","unstructured":"Byrne E., Gluesing-Luerssen H., Ravagnani A.: Fundamental properties of sum-rank-metric codes. IEEE Trans. Inf. Theory 67(10), 6456\u20136475 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1236_CR8","doi-asserted-by":"crossref","unstructured":"Cayrel P.-L., V\u00e9ron P., El\u00a0Yousfi\u00a0Alaoui S.M.: A zero-knowledge identification scheme based on the q-ary syndrome decoding problem, Selected Areas in Cryptography (Berlin, Heidelberg), Springer, Berlin, pp.\u00a0171\u2013186 (2011)","DOI":"10.1007\/978-3-642-19574-7_12"},{"key":"1236_CR9","volume-title":"Asymptotic Methods in Analysis","author":"NG De Bruijn","year":"1981","unstructured":"De Bruijn N.G.: Asymptotic Methods in Analysis, vol. 4. Courier Corporation, North Chelmsford (1981)."},{"issue":"3","key":"1236_CR10","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Series A 25(3), 226\u2013241 (1978).","journal-title":"J. Comb. Theory Series A"},{"issue":"1","key":"1236_CR11","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985).","journal-title":"Problemy Peredachi Informatsii"},{"issue":"3","key":"1236_CR12","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1002\/j.1538-7305.1952.tb01393.x","volume":"31","author":"EN Gilbert","year":"1952","unstructured":"Gilbert E.N.: A comparison of signalling alphabets. Bell Syst. Tech. J. 31(3), 504\u2013522 (1952).","journal-title":"Bell Syst. Tech. J."},{"key":"1236_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.laa.2020.03.006","volume":"596","author":"H Gluesing-Luerssen","year":"2020","unstructured":"Gluesing-Luerssen H.: On the sparseness of certain linear MRD codes. Linear Algebra Appl. 596, 145\u2013168 (2020).","journal-title":"Linear Algebra Appl."},{"key":"1236_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-70293-3_1","volume-title":"Codes Endowed with the Rank Metric. Network Coding and Subspace Designs","author":"E Gorla","year":"2018","unstructured":"Gorla E., Ravagnani A.: Codes Endowed with the Rank Metric. Network Coding and Subspace Designs, pp. 3\u201323. Springer, New York (2018)."},{"key":"1236_CR15","doi-asserted-by":"crossref","unstructured":"Gruica A., Ravagnani A.: The typical non-linear code over large alphabets. 2021 IEEE Information Theory Workshop (ITW), IEEE, pp.\u00a01\u20136 (2021).","DOI":"10.1109\/ITW48936.2021.9611444"},{"issue":"2","key":"1236_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1137\/21M1428947","volume":"6","author":"A Gruica","year":"2022","unstructured":"Gruica A., Ravagnani A.: Common complements of linear subspaces and the sparseness of MRD codes. SIAM J. Appl. Algebra Geom. 6(2), 79\u2013110 (2022).","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"1236_CR17","doi-asserted-by":"crossref","unstructured":"Gruica A., Ravagnani A., Sheekey J., Zullo F.: Rank-metric codes, semifields, and the average critical problem. arXiv:2201.07193 (2022).","DOI":"10.1137\/22M1486893"},{"issue":"2","key":"1236_CR18","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10623-017-0354-4","volume":"86","author":"A Neri","year":"2018","unstructured":"Neri A., Horlemann-Trautmann A.-L., Randrianarisoa T., Rosenthal J.: On the genericity of maximum rank distance and Gabidulin codes. Des. Codes Crypt. 86(2), 341\u2013363 (2018).","journal-title":"Des. Codes Crypt."},{"key":"1236_CR19","doi-asserted-by":"crossref","unstructured":"Ott C., Puchinger S., Bossert M.: Bounds and genericity of sum-rank-metric codes, 2021 XVII International Symposium \u201cProblems of Redundancy in Information and Control Systems\u201d(REDUNDANCY), IEEE, pp.\u00a0119\u2013124 (2021).","DOI":"10.1109\/REDUNDANCY52534.2021.9606442"},{"issue":"2","key":"1236_CR20","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed I.S., Solomon G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960).","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"3","key":"1236_CR21","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948).","journal-title":"Bell Syst. Tech. J."},{"key":"1236_CR22","first-page":"739","volume":"117","author":"RR Varshamov","year":"1957","unstructured":"Varshamov R.R.: Estimate of the number of signals in error correcting codes. Docklady Akad Nauk SSSR 117, 739\u2013741 (1957).","journal-title":"Docklady Akad Nauk SSSR"},{"key":"1236_CR23","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s002000050053","volume":"8","author":"P V\u00e9ron","year":"2009","unstructured":"V\u00e9ron P.: Improved identification schemes based on error-correcting codes. Appl. Algebra Eng. Commun. Comput. 8, 57\u201369 (2009).","journal-title":"Appl. Algebra Eng. Commun. Comput."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01236-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01236-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01236-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T15:12:38Z","timestamp":1711725158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01236-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,29]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1236"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01236-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,5,29]]},"assertion":[{"value":"15 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}