{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:54:19Z","timestamp":1776956059192,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T00:00:00Z","timestamp":1671667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T00:00:00Z","timestamp":1671667200000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s12095-022-00617-z","type":"journal-article","created":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T02:02:11Z","timestamp":1671674531000},"page":"599-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Octanary linear codes using simplicial complexes"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0174-2447","authenticated-orcid":false,"given":"Vidya","family":"Sagar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8668-1948","authenticated-orcid":false,"given":"Ritumoni","family":"Sarma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,22]]},"reference":[{"issue":"5","key":"617_CR1","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"A Ashikhmin","year":"1998","unstructured":"Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010\u20132017 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"617_CR2","first-page":"181","volume":"18","author":"A Bonisoli","year":"1984","unstructured":"Bonisoli, A.: Every equidistant linear code is a sequence of dual Hamming codes. Ars Combinatoria 18, 181\u2013186 (1984)","journal-title":"Ars Combinatoria"},{"issue":"6","key":"617_CR3","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1109\/TIT.2005.847722","volume":"51","author":"C Carlet","year":"2005","unstructured":"Carlet, C., Ding, C., Yuan, J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089\u20132102 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"617_CR4","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1007\/s10623-017-0442-5","volume":"86","author":"S Chang","year":"2018","unstructured":"Chang, S., Hyun, J.Y.: Linear codes from simplicial complexes. Des Codes Cryptogr. 86(10), 2167\u20132181 (2018)","journal-title":"Des Codes Cryptogr."},{"key":"617_CR5","doi-asserted-by":"crossref","unstructured":"Chabanne, H., Cohen, G., Patey, A.: Towards secure two-party computation from the wire-tap channel. In: Lee, H.-S., Han, D.-G. (eds.) Proceeding of ICISC 2013 (Lecture Notes in Computer Science, Vol. 8565), pp 34\u201346. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-12160-4_3"},{"issue":"8","key":"617_CR6","doi-asserted-by":"publisher","first-page":"4715","DOI":"10.1109\/TIT.2019.2907276","volume":"65","author":"C Ding","year":"2019","unstructured":"Ding, C., Heng, Z.: The subfield codes of ovoid codes. IEEE Trans. Inf. Theory 65(8), 4715\u20134729 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"617_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.13069\/jacodesmath.36866","volume":"2","author":"HQ Dinh","year":"2015","unstructured":"Dinh, H.Q., Li, C., Yue, Q.: Recent progress on weight distributions of cyclic codes over finite fields. J. Algebra Comb. Disc. Struc. Appl. 2(1), 39\u201363 (2015)","journal-title":"J. Algebra Comb. Disc. Struc. Appl."},{"key":"617_CR8","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes. http:\/\/www.codetables.de, Accessed on November 18, 2022"},{"issue":"11","key":"617_CR9","doi-asserted-by":"publisher","first-page":"5835","DOI":"10.1109\/TIT.2015.2473861","volume":"61","author":"K Ding","year":"2015","unstructured":"Ding, K., Ding, C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61(11), 5835\u20135842 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"617_CR10","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"JH Griesmer","year":"1960","unstructured":"Griesmer, J.H.: A bound for error correcting codes. IBM J. Res. Dev. 4(5), 532\u2013542 (1960)","journal-title":"IBM J. Res. Dev."},{"key":"617_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"617_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.dam.2018.07.007","volume":"254","author":"JY Hyun","year":"2019","unstructured":"Hyun, J.Y., Kim, H.K., Na, M.: Optimal non-projective linear codes constructed from down-sets. Discrete Appl. Math. 254, 135\u2013145 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"617_CR13","doi-asserted-by":"publisher","first-page":"2475","DOI":"10.1007\/s10623-020-00793-0","volume":"88","author":"JY Hyun","year":"2020","unstructured":"Hyun, J.Y., Kim, H.K., Wu, Y., Yue, Q.: Optimal minimal linear codes from posets. Des. Codes Cryptogr. 88(12), 2475\u20132492 (2020)","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"617_CR14","doi-asserted-by":"publisher","first-page":"6762","DOI":"10.1109\/TIT.2020.2993179","volume":"66","author":"JY Hyun","year":"2020","unstructured":"Hyun, J.Y., Lee, J., Lee, Y.: Infinite families of optimal linear codes constructed from simplicial complexes. IEEE Trans. Inf. Theory 66(11), 6762\u20136773 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"617_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/6400","volume-title":"Codes for Error Detection","author":"T Kl\u00f8ve","year":"2007","unstructured":"Kl\u00f8ve, T.: Codes for Error Detection. World Scientific, Hackensack (2007)"},{"key":"617_CR16","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proc. 6th Joint Swedish-Russian Int. Workshop on Info. Theory, pp. 276\u2013279 (1993)"},{"issue":"11","key":"617_CR17","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"5","key":"617_CR18","doi-asserted-by":"publisher","first-page":"3070","DOI":"10.1109\/TIT.2022.3142300","volume":"68","author":"Y Wu","year":"2022","unstructured":"Wu, Y., Li, C., Xiao, F.: Quaternary linear codes and related binary subfield codes. IEEE Trans. Inf. Theory 68(5), 3070\u20133080 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"617_CR19","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1109\/LCOMM.2020.2982381","volume":"24","author":"Y Wu","year":"2020","unstructured":"Wu, Y., Lee, Y.: Binary LCD codes and self-orthogonal codes via simplicial complexes. IEEE Commun. Lett. 24(6), 1159\u20131162 (2020)","journal-title":"IEEE Commun. Lett."},{"issue":"1","key":"617_CR20","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/TIT.2005.860412","volume":"52","author":"J Yuan","year":"2006","unstructured":"Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206\u2013212 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"617_CR21","doi-asserted-by":"publisher","first-page":"5124","DOI":"10.3934\/math.2021303","volume":"6","author":"X Zhu","year":"2021","unstructured":"Zhu, X., Wei, Y.: Few-weight quaternary codes via simplicial complexes. AIMS Math. 6(5), 5124\u20135132 (2021)","journal-title":"AIMS Math."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00617-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-022-00617-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-022-00617-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T21:34:29Z","timestamp":1728596069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-022-00617-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,22]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["617"],"URL":"https:\/\/doi.org\/10.1007\/s12095-022-00617-z","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,22]]},"assertion":[{"value":"9 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Consent for Publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}