{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T18:39:46Z","timestamp":1782585586440,"version":"3.54.5"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,2,9]],"date-time":"2016-02-09T00:00:00Z","timestamp":1454976000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00200-016-0286-7","type":"journal-article","created":{"date-parts":[[2016,2,9]],"date-time":"2016-02-09T01:54:21Z","timestamp":1454982861000},"page":"399-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partial permutation decoding for MacDonald codes"],"prefix":"10.1007","volume":"27","author":[{"given":"Jennifer D","family":"Key","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Padmapani","family":"Seneviratne","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,2,9]]},"reference":[{"key":"286_CR1","doi-asserted-by":"crossref","unstructured":"Assmus, Jr., E.F., Key, J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992), Cambridge Tracts in Mathematics, Vol. 103 (Second printing with corrections, 1993)","DOI":"10.1017\/CBO9781316529836"},{"key":"286_CR2","doi-asserted-by":"crossref","unstructured":"Bhandar, M.C., Durairajan, C.: A note on covering radius of MacDonald codes. In: Proceedings of the International Conference on Information Technology: Computers and Communications (ITCC03) 0-7695-1916-4\/03, IEEE (2003)","DOI":"10.1109\/ITCC.2003.1197530"},{"issue":"3\/4","key":"286_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symb. Comput. 24(3\/4), 235-265 (1997)","journal-title":"J. Symb. Comput."},{"key":"286_CR4","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0097-3165(93)90085-M","volume":"64","author":"Richard\u00a0A Brualdi","year":"1993","unstructured":"Brualdi, Richard A, Pless, Vera S: Greedy codes. J. Combin. Theory, Ser. A 64, 10-30 (1993)","journal-title":"J. Combin. Theory, Ser.\u00a0A"},{"key":"286_CR5","unstructured":"Cannon, J., Steel, A., White, G.: Linear codes over finite fields. In: Cannon, J., Bosma, W. (eds.) Handbook of Magma Functions, Computational Algebra Group, V2.13, pp. 3951-4023. Department of Mathematics, University of Sydney (2006) http:\/\/magma.maths.usyd.edu.au\/magma"},{"key":"286_CR6","doi-asserted-by":"crossref","first-page":"505","DOI":"10.3934\/amc.2012.6.505","volume":"6","author":"Washiela Fish","year":"2012","unstructured":"Fish, Washiela, Key, Jennifer D., Mwambene, Eric: Partial permutation decoding for simplex codes. Adv. Math. Commun. 6, 505-516 (2012)","journal-title":"Adv. Math. Commun."},{"key":"286_CR7","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TIT.1982.1056504","volume":"28","author":"Daniel M Gordon","year":"1982","unstructured":"Gordon, Daniel M.: Minimal permutation sets for decoding the binary Golay codes. IEEE Trans. Inform. Theory 28, 541-543 (1982)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"286_CR8","unstructured":"Cary Huffman, W.: Codes and groups. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, Volume 2, Part 2, Chapter 17, pp. 1345-1440. Elsevier, Amsterdam (1998)"},{"key":"286_CR9","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/j.ejc.2004.04.007","volume":"26","author":"JD Key","year":"2005","unstructured":"Key, J.D., McDonough, T.P., Mavron, V.C.: Partial permutation decoding for codes from finite planes. Eur. J. Combin. 26, 665-682 (2005)","journal-title":"Eur. J. Combin."},{"key":"286_CR10","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.ffa.2005.05.007","volume":"12","author":"JD Key","year":"2006","unstructured":"Key, J.D., McDonough, T.P., Mavron, V.C.: Information sets and partial permutation decoding for codes from finite geometries. Finite Fields Appl. 12, 232-247 (2006)","journal-title":"Finite Fields Appl."},{"key":"286_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.disc.2004.11.020","volume":"301","author":"Hans-Joachim Kroll","year":"2005","unstructured":"Kroll, Hans-Joachim, Vincenti, Rita: PD-sets related to the codes of some classical varieties. Discret. Math. 301, 89-105 (2005)","journal-title":"Discret. Math."},{"key":"286_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1147\/rd.41.0043","volume":"4","author":"JE MacDonald","year":"1960","unstructured":"MacDonald, J.E.: Design methods for maximum minimum-distance error-correcting codes. IBM J. Res. Dev. 4, 43-57 (1960)","journal-title":"IBM J. Res. Dev."},{"key":"286_CR13","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1002\/j.1538-7305.1964.tb04075.x","volume":"43","author":"FJ MacWilliams","year":"1964","unstructured":"MacWilliams, F.J.: Permutation decoding of systematic codes. Bell Syst. Tech. J. 43, 485-505 (1964)","journal-title":"Bell Syst. Tech. J."},{"key":"286_CR14","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1983","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1983)"},{"key":"286_CR15","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1975.1055315","volume":"21","author":"AM Patel","year":"1975","unstructured":"Patel, A.M.: Maximal $q$-ary linear codes with large minimum distance. IEEE Trans. Inform. Theory 21, 106-110 (1975)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"286_CR16","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.2140\/pjm.1964.14.1405","volume":"14","author":"J Sch\u00f6nheim","year":"1964","unstructured":"Sch\u00f6nheim, J.: On coverings. Pac. J. Math. 14, 1405-1411 (1964)","journal-title":"Pac. J. Math."},{"issue":"1","key":"286_CR17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10623-004-3802-x","volume":"37","author":"AJ Zanten van","year":"2005","unstructured":"van Zanten, A.J., Nengah Suparta, I.: On the construction of linear $q$-ary lexicodes. Des. Codes Cryptogr. 37(1), 15-29 (2005)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-016-0286-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-016-0286-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-016-0286-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-016-0286-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T11:24:26Z","timestamp":1558610666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-016-0286-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,9]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["286"],"URL":"https:\/\/doi.org\/10.1007\/s00200-016-0286-7","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,9]]}}}