{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:53:09Z","timestamp":1775145189130,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540601142","type":"print"},{"value":"9783540494409","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60114-7_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:43:44Z","timestamp":1330278224000},"page":"96-105","source":"Crossref","is-referenced-by-count":30,"title":["Variations on minimal codewords in linear codes"],"prefix":"10.1007","author":[{"given":"A.","family":"Ashikhmin","sequence":"first","affiliation":[]},{"given":"A.","family":"Barg","sequence":"additional","affiliation":[]},{"given":"G.","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"L.","family":"Huguet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"7_CR1","unstructured":"D. J. A. Welsh, Matroid Theory, Academic Press (1976)."},{"issue":"No.6","key":"7_CR2","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/TIT.1979.1056120","volume":"IT-25","author":"T.-Y. Hwang","year":"1979","unstructured":"T.-Y. Hwang, \u201cDecoding linear block codes for minimizing word error rate,\u201d IEEE Trans. Inf. Theory, IT-25, No. 6 (November 1979), 733\u2013737.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR3","unstructured":"J. Massey, \u201cMinimal codewords and secret sharing,\u201d in: Proc. Sixth Joint Swedish-Russian Workshop Inf. Theory, M\u00f6lle, Sweden (1993), pp. 246\u2013249."},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-58265-7_5","volume":"829","author":"G. R. Blakley","year":"1994","unstructured":"G. R. Blakley and G. A. Kabatianskii, \u201cLinear algebra approach to secret sharing schemes,\u201d in: Error Control, Cryptology, and Speech Compression, Selected papers from Int. Workshop on Inf. Protection, Moscow, Dec. 1993, Springer Lect. Notes. Comput. Sci., 829 (1994), pp. 33\u201340.","journal-title":"Springer Lect. Notes. Comput. Sci."},{"key":"7_CR5","unstructured":"A. Ashikhmin and A. Barg, \u201cMinimal vectors in linear codes and sharing of secrets,\u201d Preprint 94-113, SFB 343 \u201cDiskrete Structure in der Mathematik,\u201d Universit\u00e4t Bielefeld (1994)."},{"issue":"no.4","key":"7_CR6","first-page":"123","volume":"1","author":"A. A. Nechaev","year":"1989","unstructured":"A. A. Nechaev, \u201cKerdock code in a cyclic form,\u201d Diskret. Mat., 1, no. 4 (1989), 123\u2013139. English translation in Discrete Math. Appl., 1 (1991), 365\u2013384.","journal-title":"Diskret. Mat."},{"issue":"no.2","key":"7_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"A. R. Hammons","year":"1994","unstructured":"A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, and P. Sol\u00e9, \u201cThe \u21244-linearity of Kerdock, Preparata, Goethals, and related codes,\u201d IEEE Trans. Inf. Theory, 40, no. 2 (1994), 301\u2013319.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"G. R. Blakley and C. Meadows, \u201cSecurity of ramp schemes,\u201d in: Advances in Cryptology, Proc. CRYPTO '84, G. R. Blakley and D. Chaum, Eds., Springer Lect. Notes Comput. Sci., 196 (1985), pp. 242\u2013268.","DOI":"10.1007\/3-540-39568-7_20"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-48285-7_11","volume":"765","author":"K. Kurosawa","year":"1994","unstructured":"K. Kurosawa, K. Okada, K. Sakano, W. Ogata, and S. Tsujii, \u201cNonperfect secret sharing schemes and matroids,\u201d in: Proc. EUROCRYPT '93, Springer Lect. Notes Comput. Sci., 765 (1994), pp. 126\u2013141.","journal-title":"Springer Lect. Notes Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60114-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:51Z","timestamp":1619573511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60114-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601142","9783540494409"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-60114-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}