{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:23Z","timestamp":1772283563745,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,4,23]],"date-time":"2016-04-23T00:00:00Z","timestamp":1461369600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo (BR)","doi-asserted-by":"publisher","award":["12\/03526-0"],"award-info":[{"award-number":["12\/03526-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca (MIUR)","award":["PRIN project No. 2012XZE22K_006"],"award-info":[{"award-number":["PRIN project No. 2012XZE22K_006"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10623-016-0207-6","type":"journal-article","created":{"date-parts":[[2016,4,23]],"date-time":"2016-04-23T07:50:24Z","timestamp":1461397824000},"page":"115-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On linear codes admitting large automorphism groups"],"prefix":"10.1007","volume":"83","author":[{"given":"Nicola","family":"Pace","sequence":"first","affiliation":[]},{"given":"Angelo","family":"Sonnino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,23]]},"reference":[{"key":"207_CR1","unstructured":"Abbott R., Bray J., Linton S., Nickerson S., Norton S., Parker R., Suleiman I., Tripp J., Walsh P., Wilson R.: Atlas of finite group representations\u2014version 3. http:\/\/brauer.maths.qmul.ac.uk\/Atlas\/v3 . Accessed 1 July 2015."},{"key":"207_CR2","doi-asserted-by":"crossref","unstructured":"Berger T.P.: Cyclic alternant codes induced by an automorphism of a GRS code. In: Finite Fields: Theory, Applications, and Algorithms (Waterloo, ON, 1997), Contemporary Mathematics, vol. 225, pp. 143\u2013154. American Mathematical Society, Providence (1999).","DOI":"10.1090\/conm\/225\/03216"},{"key":"207_CR3","unstructured":"Bierbrauer J.: Introduction to Coding Theory, Discrete Mathematics and Its Applications. Chapman & Hall\/CRC, Boca Raton (2005)."},{"key":"207_CR4","doi-asserted-by":"crossref","unstructured":"Bosma W., Cannon J.J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997).","DOI":"10.1006\/jsco.1996.0125"},{"key":"207_CR5","doi-asserted-by":"crossref","unstructured":"Braun M., Kohnert A., Wassermann A.: Optimal linear codes from matrix groups. IEEE Trans. Inf. Theory 51(12), 4247\u20134251 (2005).","DOI":"10.1109\/TIT.2005.859291"},{"key":"207_CR6","doi-asserted-by":"crossref","unstructured":"Camion P.: Linear codes with given automorphism groups. Discret. Math. 3, 33\u201345 (1972).","DOI":"10.1016\/0012-365X(72)90023-4"},{"key":"207_CR7","unstructured":"Cossidente A., Nol\u00e8 C., Sonnino A.: Cap codes arising from duality. Bull. Inst. Combin. Appl. 67, 33\u201342 (2013)."},{"key":"207_CR8","doi-asserted-by":"crossref","unstructured":"Cossidente A., Sonnino A.: Finite geometry and the Gale transform. Discret. Math. 310(22), 3206\u20133210 (2010).","DOI":"10.1016\/j.disc.2009.08.019"},{"key":"207_CR9","unstructured":"Cossidente A., Sonnino A.: Some recent results in finite geometry and coding theory arising from the Gale transform. Rend. Mat. Appl. (7) 30(1), 67\u201376. (2010)."},{"key":"207_CR10","doi-asserted-by":"crossref","unstructured":"Cossidente A., Sonnino A.: Linear codes arising from the Gale transform of distinguished subsets of some projective spaces. Discret. Math. 312(3), 647\u2013651 (2012).","DOI":"10.1016\/j.disc.2011.05.022"},{"key":"207_CR11","unstructured":"Crnkovi\u0107 D., Rukavina S., Sim\u010di\u0107 L.: Binary doubly-even self-dual codes of length 72 with large automorphism groups. Math. Commun. 18(2), 297\u2013308 (2013)."},{"key":"207_CR12","doi-asserted-by":"crossref","unstructured":"Fish W., Key J.D., Mwambene E.: Partial permutation decoding for simplex codes. Adv. Math. Commun. 6(4), 505\u2013516 (2012).","DOI":"10.3934\/amc.2012.6.505"},{"key":"207_CR13","doi-asserted-by":"crossref","unstructured":"Giulietti M., Korchm\u00e1ros G., Marcugini S., Pambianco F.: Transitive $$A_6$$ A 6 -invariant $$k$$ k -arcs in $$PG(2, q)$$ P G ( 2 , q ) . Des. Codes Cryptogr. 68(1\u20133), 73\u201379 (2013).","DOI":"10.1007\/s10623-012-9619-0"},{"key":"207_CR14","doi-asserted-by":"crossref","unstructured":"Gordon D.M.: Minimal permutation sets for decoding the binary Golay codes. IEEE Trans. Inf. Theory 28(3), 541\u2013543 (1982).","DOI":"10.1109\/TIT.1982.1056504"},{"key":"207_CR15","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de . Accessed 2 Apr 2016."},{"key":"207_CR16","doi-asserted-by":"crossref","unstructured":"Higman G.: On the simple group of D. G. Higman and C. C. Sims. Ill. J. Math. 13, 74\u201380 (1969).","DOI":"10.1215\/ijm\/1256053736"},{"key":"207_CR17","doi-asserted-by":"crossref","unstructured":"Higman D.G., Sims C.C.: A simple group of order $$44,352,000$$ 44 , 352 , 000 . Math. Z. 105, 110\u2013113 (1968).","DOI":"10.1007\/BF01110435"},{"key":"207_CR18","unstructured":"Hill R.: On the largest size of cap in $$S_{5,\\,3}$$ S 5 , 3 , Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8) 54(1973), 378\u2013384 (1974)."},{"key":"207_CR19","unstructured":"Hill R.: A First Course in Coding Theory, Oxford Applied Mathematics and Computing Science Series. The Clarendon Press, Oxford University Press, New York (1986)."},{"key":"207_CR20","doi-asserted-by":"crossref","unstructured":"Hirschfeld J.W.P., Korchmaros G., Torres F.: Algebraic Curves Over a Finite Field. Princeton University Press, Princeton (2008).","DOI":"10.1515\/9781400847419"},{"key":"207_CR21","unstructured":"Huffman W.C.: Codes and groups. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, part 2, vol. 2, pp.\u00a01345\u20131440. North-Holland, Amsterdam (1998)."},{"key":"207_CR22","doi-asserted-by":"crossref","unstructured":"Indaco L., Korchm\u00e1ros G.: 42-arcs in $$PG(2, q)$$ P G ( 2 , q ) left invariant by $$PSL(2,7)$$ P S L ( 2 , 7 ) . Des. Codes Cryptogr. 64(1\u20132), 33\u201346 (2012).","DOI":"10.1007\/s10623-011-9532-y"},{"key":"207_CR23","unstructured":"Key J.D.: Permutation decoding for codes from designs, finite geometries and graphs. In: Crnkovi\u010d D., Tonchev V. (eds.) Information Security, Coding Theory and Related Combinatorics. NATO Science for Peace and Security Series D: Information and Communication Security, vol.\u00a029, pp.\u00a0172\u2013201. IOS, Amsterdam (2011)."},{"key":"207_CR24","doi-asserted-by":"crossref","unstructured":"Key J.D., McDonough T.P., Mavron V.C.: Partial permutation decoding for codes from finite planes. Eur. J. Comb. 26(5), 665\u2013682 (2005).","DOI":"10.1016\/j.ejc.2004.04.007"},{"key":"207_CR25","doi-asserted-by":"crossref","unstructured":"Key J.D., Moori J., Rodrigues B.G.: Permutation decoding for the binary codes from triangular graphs. Eur. J. Comb. 25(1), 113\u2013123 (2004).","DOI":"10.1016\/j.ejc.2003.08.001"},{"key":"207_CR26","doi-asserted-by":"crossref","unstructured":"Knapp W., Schaeffer H.-J.: On the codes related to the Higman\u2013Sims graph. Electron. J. Comb. 22(1), P1\u2013P19 (2015).","DOI":"10.37236\/4267"},{"key":"207_CR27","doi-asserted-by":"crossref","unstructured":"Knapp W., Schmid P.: Codes with prescribed permutation group. J. Algebra 67(2), 415\u2013435 (1980).","DOI":"10.1016\/0021-8693(80)90169-6"},{"key":"207_CR28","doi-asserted-by":"crossref","unstructured":"Kohnert A.: Constructing two-weight codes with prescribed groups of automorphisms. Discret. Appl. Math. 155(11), 1451\u20131457 (2007).","DOI":"10.1016\/j.dam.2007.03.006"},{"key":"207_CR29","doi-asserted-by":"crossref","unstructured":"Kohnert A., Wassermann A.: Construction of binary and ternary self-orthogonal linear codes. Discret. Appl. Math. 157(9), 2118\u20132123 (2009).","DOI":"10.1016\/j.dam.2007.10.030"},{"key":"207_CR30","doi-asserted-by":"crossref","unstructured":"Kohnert A., Zwanzger J.: New linear codes with prescribed group of automorphisms found by heuristic search. Adv. Math. Commun. 3(2), 157\u2013166 (2009).","DOI":"10.3934\/amc.2009.3.157"},{"key":"207_CR31","doi-asserted-by":"crossref","unstructured":"Korchm\u00e1ros G., Pace N.: Infinite family of large complete arcs in $$\\text{ PG }(2, q^n)$$ PG ( 2 , q n ) , with $$q$$ q odd and $$n>1$$ n > 1 odd. Des. Codes Cryptogr. 55(2\u20133), 285\u2013296 (2010).","DOI":"10.1007\/s10623-009-9343-6"},{"key":"207_CR32","doi-asserted-by":"crossref","unstructured":"Kramer E.S., Mesner D.M.: $$t$$ t -Designs on hypergraphs. Discret. Math. 15, 263\u2013296 (1976).","DOI":"10.1016\/0012-365X(76)90030-3"},{"key":"207_CR33","doi-asserted-by":"crossref","unstructured":"Kroll H.-J., Vincenti R.: PD-sets for the codes related to some classical varieties. Discret. Math. 301(1), 89\u2013105 (2005).","DOI":"10.1016\/j.disc.2004.11.020"},{"key":"207_CR34","doi-asserted-by":"crossref","unstructured":"Kroll H.-J., Vincenti R.: Antiblocking systems and PD-sets. Discret. Math. 308(2\u20133), 401\u2013407 (2008).","DOI":"10.1016\/j.disc.2006.11.056"},{"key":"207_CR35","doi-asserted-by":"crossref","unstructured":"Kroll H.-J., Vincenti R.: PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of PG(5, 2). Discret. Math. 308(2\u20133), 408\u2013414 (2008).","DOI":"10.1016\/j.disc.2006.11.057"},{"key":"207_CR36","doi-asserted-by":"crossref","unstructured":"MacWilliams F.J.: Permutation decoding of systematic codes. Bell System Tech. J. 43(1), 485\u2013505 (1964).","DOI":"10.1002\/j.1538-7305.1964.tb04075.x"},{"key":"207_CR37","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. I. North-Holland Mathematical Library, vol. 16. North-Holland, Amsterdam (1977)."},{"key":"207_CR38","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. II. North-Holland Mathematical Library, vol. 16. North-Holland, Amsterdam (1977)."},{"key":"207_CR39","doi-asserted-by":"crossref","unstructured":"Martis M., Bamberg J., Morris S.: An enumeration of certain projective ternary two-weight codes. J. Comb. Des. 24(1), 21\u201335 (2016).","DOI":"10.1002\/jcd.21420"},{"key":"207_CR40","doi-asserted-by":"crossref","unstructured":"Pace N.: New ternary linear codes from projectivity groups. Discret. Math. 331, 22\u201326 (2014).","DOI":"10.1016\/j.disc.2014.04.027"},{"key":"207_CR41","doi-asserted-by":"crossref","unstructured":"Pace N.: On small complete arcs and transitive $$A_5$$ A 5 -invariant arcs in the projective plane $$PG(2, q)$$ P G ( 2 , q ) . J. Comb. Des. 22(10), 425\u2013434 (2014).","DOI":"10.1002\/jcd.21372"},{"key":"207_CR42","doi-asserted-by":"crossref","unstructured":"Rodrigues B.G.: Self-orthogonal designs and codes from the symplectic groups $$S_4(3)$$ S 4 ( 3 ) and $$S_4(4)$$ S 4 ( 4 ) . Discret. Math. 308(10), 1941\u20131950 (2008).","DOI":"10.1016\/j.disc.2007.04.047"},{"key":"207_CR43","doi-asserted-by":"crossref","unstructured":"Sonnino A.: Transitive PSL(2, 7)-invariant 42-arcs in 3-dimensional projective spaces. Des. Codes Cryptogr. 72(2), 455\u2013463 (2014).","DOI":"10.1007\/s10623-012-9778-z"},{"key":"207_CR44","doi-asserted-by":"crossref","unstructured":"Tolhuizen L.M.G.M., van Gils W.J.: A large automorphism group decreases the number of computations in the construction of an optimal encoder\/decoder pair for a linear block code. IEEE Trans. Inf. Theory 34(2), 333\u2013338 (1988).","DOI":"10.1109\/18.2646"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0207-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0207-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0207-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0207-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T01:29:56Z","timestamp":1600478996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0207-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,23]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["207"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0207-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,23]]}}}