{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:54:21Z","timestamp":1776956061967,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10623-024-01534-3","type":"journal-article","created":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T12:52:50Z","timestamp":1734526370000},"page":"725-736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal combinatorial neural codes via symmetric designs"],"prefix":"10.1007","volume":"93","author":[{"given":"Xingyu","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shukai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuiling","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,18]]},"reference":[{"key":"1534_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0019-9958(61)80037-5","volume":"4","author":"JM Berger","year":"1961","unstructured":"Berger J.M.: A note on error detection codes for asymmetric channels. Inf. Control 4, 68\u201373 (1961).","journal-title":"Inf. Control"},{"key":"1534_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139507660","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999)."},{"key":"1534_CR3","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1038\/14731","volume":"2","author":"A Borst","year":"1999","unstructured":"Borst A., Theunissen F.E.: Information theory and neural coding. Nat. Neurosci. 2, 947\u2013957 (1999).","journal-title":"Nat. Neurosci."},{"key":"1534_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/S0019-9958(79)90329-2","volume":"40","author":"SD Constantin","year":"1979","unstructured":"Constantin S.D., Rao T.R.N.: On the theory of binary asymmetric error correcting codes. Inf. Control 40, 20\u201336 (1979).","journal-title":"Inf. Control"},{"key":"1534_CR5","doi-asserted-by":"publisher","first-page":"2941","DOI":"10.1109\/TIT.2022.3147593","volume":"68","author":"G Cotardo","year":"2022","unstructured":"Cotardo G., Ravagnani A.: Parameters of codes for the binary asymmetric channel. IEEE Trans. Inf. Theory 68, 2941\u20132950 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1534_CR6","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1007\/s11538-013-9860-3","volume":"75","author":"C Curto","year":"2013","unstructured":"Curto C., Itskov V., Veliz-Cuba A., Youngs N.: The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes. Bull. Math. Biol. 75, 1571\u20131611 (2013).","journal-title":"Bull. Math. Biol."},{"key":"1534_CR7","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1162\/NECO_a_00459","volume":"25","author":"C Curto","year":"2013","unstructured":"Curto C., Itskov V., Morrison K., Roth Z., Walker J.L.: Combinatorial neural codes from a mathematical coding theory perspective. Neural Comput. 25, 1891\u20131925 (2013).","journal-title":"Neural Comput."},{"key":"1534_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01294837","volume":"3","author":"G Fang","year":"1992","unstructured":"Fang G., van Tilborg H.C.A.: Bounds and constructions of asymmetric or unidirectional error-correcting codes. Appl. Algebra Eng. Commun. Comput. 3, 269\u2013300 (1992).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1534_CR9","doi-asserted-by":"crossref","unstructured":"Gabrys R., Dolecek L.: Coding for the binary asymmetric channel. In: 2012 International Conference on Computing, Networking and Communications (ICNC), Maui, HI, USA, 2012, pp. 461\u2013465 (2012).","DOI":"10.1109\/ICCNC.2012.6167465"},{"key":"1534_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.aam.2017.10.002","volume":"95","author":"E Gross","year":"2018","unstructured":"Gross E., Obatake N., Youngs N.: Neural ideals and stimulus space visualization. Adv. Appl. Math. 95, 65\u201395 (2018).","journal-title":"Adv. Appl. Math."},{"key":"1534_CR11","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1109\/TIT.1981.1056291","volume":"27","author":"T Kl\u00f8ve","year":"1981","unstructured":"Kl\u00f8ve T.: Upper bounds on codes correcting asymmetric errors. IEEE Trans. Inf. Theory 27, 128\u2013131 (1981).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1534_CR12","doi-asserted-by":"crossref","unstructured":"Kova\u010devi\u0107 M., Vukobratovi\u0107 D.: Optimal error-detecting codes for general asymmetric channels via Sperner theory. In: IEEE Information Theory Workshop (ITW), 2022 (2022).","DOI":"10.1109\/ITW54588.2022.9965829"},{"key":"1534_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0006-8993(71)90358-1","volume":"34","author":"J O\u2019Keefe","year":"1971","unstructured":"O\u2019Keefe J., Dostrovsky J.: The hippocampus as a spatial map. Preliminary evidence from unit activity in the freely-moving rat. Brain Res. 34, 171\u2013175 (1971).","journal-title":"Brain Res."},{"key":"1534_CR14","unstructured":"Rao T.R.N., Chawla A.S.: Asymmetric error codes for some LSI semi-conductor memories. In: The Annual Southeastern Symposium on System Theory, 1975, pp. 170\u2013171 (1975)."},{"key":"1534_CR15","unstructured":"Seberry J., Yamada M.: Hadamard matrices, sequences, and block designs. In: Contemporary Design Theory: A Collection of Surveys, pp. 431\u2013560. Wiley, New York (1992)."},{"key":"1534_CR16","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1109\/18.21262","volume":"34","author":"JH Weber","year":"1988","unstructured":"Weber J.H., Vroedt C.D., Boekee D.E.: Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6. IEEE Trans. Inf. Theory 34, 1321\u20131331 (1988).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1534_CR17","doi-asserted-by":"publisher","first-page":"5440","DOI":"10.1109\/TIT.2023.3266010","volume":"69","author":"A Zhang","year":"2023","unstructured":"Zhang A., Jing X., Feng K.: Optimal combinatorial neural codes with matched metric $$\\delta _r$$: characterization and constructions. IEEE Trans. Inf. Theory 69, 5440\u20135448 (2023).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01534-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01534-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01534-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T16:40:47Z","timestamp":1742229647000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01534-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,18]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1534"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01534-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,18]]},"assertion":[{"value":"21 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}