{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:02:08Z","timestamp":1772283728993,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T00:00:00Z","timestamp":1227657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s10623-008-9249-8","type":"journal-article","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T16:55:43Z","timestamp":1227718543000},"page":"131-140","source":"Crossref","is-referenced-by-count":25,"title":["Polarities, quasi-symmetric designs, and Hamada\u2019s conjecture"],"prefix":"10.1007","volume":"51","author":[{"given":"Dieter","family":"Jungnickel","sequence":"first","affiliation":[]},{"given":"Vladimir D.","family":"Tonchev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,26]]},"reference":[{"key":"9249_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and their Codes","author":"E.F. Assmus Jr.","year":"1992","unstructured":"Assmus E.F. Jr., Key J.D.: Designs and their Codes. Cambridge University Press, Cambridge (1992)"},{"key":"9249_CR2","first-page":"1269","volume-title":"Handbook of Coding Theory, vol. II","author":"E.F. Assmus Jr.","year":"1998","unstructured":"Assmus E.F. Jr., Key J.D.: Polynomial codes and finite geometries. In: Pless, V., Huffman, W.C.(eds) Handbook of Coding Theory, vol. II. pp. 1269\u20131343. North Holland, Amsterdam (1998)"},{"key":"9249_CR3","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1016\/j.disc.2005.11.034","volume":"306","author":"A. Baartmans","year":"2006","unstructured":"Baartmans A., Sane S.: A characterization of projective subspaces of codimension two as quasi-symmetric designs with good blocks. Discrete Math. 306, 1493\u20131501 (2006)","journal-title":"Discrete Math."},{"key":"9249_CR4","doi-asserted-by":"crossref","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory, 2nd edn. Cambridge University Press (1999).","DOI":"10.1017\/CBO9781139507660"},{"key":"9249_CR5","volume-title":"Handbook of Combinatorial Designs","author":"C.J. Colbourn","year":"2007","unstructured":"Colbourn C.J., Dinitz J.H.: Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2007)","edition":"2"},{"key":"9249_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01174898","volume":"163","author":"J. Doyen","year":"1978","unstructured":"Doyen J., Hubaut X., Vandensavel M.: Ranks of incidence matrices of Steiner triple systems. Math. Z. 163, 251\u2013259 (1978)","journal-title":"Math. Z."},{"key":"9249_CR7","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/TIT.1968.1054126","volume":"14","author":"J.-M. Goethals","year":"1968","unstructured":"Goethals J.-M., Delsarte P.: On a class of majority-logic decodable cyclic codes. IEEE Trans. Inform. Theory 14, 182\u2013188 (1968)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9249_CR8","doi-asserted-by":"crossref","first-page":"154","DOI":"10.32917\/hmj\/1206137446","volume":"3","author":"N. Hamada","year":"1973","unstructured":"Hamada N.: On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its application to error correcting codes. Hiroshima Math. J. 3, 154\u2013226 (1973)","journal-title":"Hiroshima Math. J."},{"key":"9249_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0097-3165(75)90001-1","volume":"18","author":"N. Hamada","year":"1975","unstructured":"Hamada N., Ohmori H.: On the BIB-design having the minimum p-rank. J. Combin. Theory Ser. A 18, 131\u2013140 (1975)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9249_CR10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10623-003-4195-y","volume":"34","author":"M. Harada","year":"2005","unstructured":"Harada M., Lam C.W.H., Tonchev V.D.: Symmetric (4,4)-nets and generalized Hadamard matrices over groups of order 4. Des. Codes Cryptogr. 34, 71\u201387 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"9249_CR11","unstructured":"Hirschfeld J.W.P.: Finite Projective Spaces of Three Dimensions. Oxford University Press (1085)."},{"key":"9249_CR12","doi-asserted-by":"crossref","unstructured":"Hirschfeld J.W.P.: Projective Geometries Over Finite Fields, 2nd edn. Oxford University Press (1998).","DOI":"10.1093\/oso\/9780198502951.001.0001"},{"key":"9249_CR13","unstructured":"Hirschfeld J.W.P., Shaw R.: Projective geometry codes over prime fields. In: Finite Fields: Theory, Application and Algorithms. Contemporary Math, vol. 168, pp. 151\u2013163. Amer Math. Soc., Providence, R.I. (1994)."},{"key":"9249_CR14","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02415499","volume":"26","author":"J.L.W.V. Jensen","year":"1902","unstructured":"Jensen J.L.W.V.: Sur une identit\u00e9 d\u2019Abel et sur d\u2019autres formules analogues. Acta Math. 26, 307\u2013318 (1902)","journal-title":"Acta Math."},{"key":"9249_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00146828","volume":"16","author":"D. Jungnickel","year":"1984","unstructured":"Jungnickel D.: The number of designs with classical parameters grows exponentially. Geom. Dedicata 16, 167\u2013178 (1984)","journal-title":"Geom. Dedicata"},{"key":"9249_CR16","unstructured":"Jungnickel D., Tonchev V.D.: The number of designs with classical parameters grows exponentially, II. (In preparation)."},{"key":"9249_CR17","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/A:1022416002358","volume":"3","author":"W.M. Kantor","year":"1994","unstructured":"Kantor W.M.: Automorphisms and isomorphisms of symmetric and affine designs. J. Algebraic Combin. 3, 307\u2013338 (1994)","journal-title":"J. Algebraic Combin."},{"key":"9249_CR18","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1006\/jcta.2000.3060","volume":"92","author":"C. Lam","year":"2000","unstructured":"Lam C., Lam S., Tonchev V.D.: Bounds on the number of affine, symmetric, and Hadamard designs and matrices. J. Combin. Theory Ser. A 92, 186\u2013196 (2000)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9249_CR19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1016502619995","volume":"27","author":"C. Lam","year":"2002","unstructured":"Lam C., Tonchev V.D.: A new bound on the number of designs with classical affine parameters. Des. Codes Cryptogr. 27, 111\u2013117 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"9249_CR20","doi-asserted-by":"crossref","unstructured":"Larsen M.E.: Summa Summarum. In: CMS Treatises in Mathematics, Canadian Mathematical Society, Ottawa, ON; A K Peters, Ltd., Wellesley, MA (2007).","DOI":"10.1201\/b10582"},{"key":"9249_CR21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1023\/A:1022536423514","volume":"28","author":"V.C. Mavron","year":"2003","unstructured":"Mavron V.C., McDonough T.P., Shrikhande M.S.: Quasi-symmetric designs with good blocks and intersection number one. Des. Codes Cryptogr. 28, 147\u2013162 (2003)","journal-title":"Des. Codes Cryptogr."},{"key":"9249_CR22","doi-asserted-by":"crossref","first-page":"2742","DOI":"10.1016\/j.disc.2006.06.039","volume":"308","author":"V.C. Mavron","year":"2008","unstructured":"Mavron V.C., McDonough T.P., Tonchev V.D.: On affine designs and Hadamard designs with line spreads. Discrete Math. 308, 2742\u20132750 (2008)","journal-title":"Discrete Math."},{"key":"9249_CR23","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/jcd.3180030607","volume":"3","author":"T.P. McDonough","year":"1995","unstructured":"McDonough T.P., Mavron V.C.: Quasi-symmetric designs with good blocks. J. Combin. Des. 3, 433\u2013441 (1995)","journal-title":"J. Combin. Des."},{"key":"9249_CR24","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/TIT.1975.1055428","volume":"21","author":"M. Rahman","year":"1975","unstructured":"Rahman M., Blake I.F.: Majority logic decoding using combinatorial designs. IEEE Trans. Inform. Theory 21, 585\u2013587 (1975)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9249_CR25","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/TIT.1967.1053994","volume":"23","author":"L.D. Rudolph","year":"1967","unstructured":"Rudolph L.D.: A class of majority-logic decodable codes. IEEE Trans. Inform. Theory 23, 305\u2013307 (1967)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9249_CR26","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01388414","volume":"3","author":"S.S. Sane","year":"1993","unstructured":"Sane S.S., Shrikhande M.S.: Some characterizations of quasi-symmetric designs with a spread. Des. Codes Cryptogr. 3, 155\u2013166 (1993)","journal-title":"Des. Codes Cryptogr."},{"key":"9249_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511665615","volume-title":"Quasi-symmetric Designs","author":"M.S. Shrikhande","year":"1991","unstructured":"Shrikhande M.S., Sane S.S.: Quasi-symmetric Designs. Cambridge University Press, Cambridge (1991)"},{"key":"9249_CR28","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0097-3165(80)90072-2","volume":"28","author":"L. Teirlinck","year":"1980","unstructured":"Teirlinck L.: On projective and affine hyperplanes. J. Combin. Theory Ser. A 28, 290\u2013306 (1980)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9249_CR29","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0097-3165(86)90009-9","volume":"42","author":"V.D. Tonchev","year":"1986","unstructured":"Tonchev V.D.: Quasi-symmetric 2-(31, 7, 7)-designs and a revision of Hamada\u2019s conjecture. J. Combin. Theory Ser. A 42, 104\u2013110 (1986)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9249_CR30","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1008314923487","volume":"17","author":"V.D. Tonchev","year":"1999","unstructured":"Tonchev V.D.: Linear perfect codes and a characterization of the classical designs. Des. Codes Cryptogr. 17, 121\u2013128 (1999)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9249-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9249-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9249-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T11:02:52Z","timestamp":1709463772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9249-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,26]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["9249"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9249-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,26]]}}}