{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:07:29Z","timestamp":1761059249975},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,11,11]],"date-time":"2011-11-11T00:00:00Z","timestamp":1320969600000},"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":[[2012,10]]},"DOI":"10.1007\/s10623-011-9580-3","type":"journal-article","created":{"date-parts":[[2011,11,10]],"date-time":"2011-11-10T14:15:37Z","timestamp":1320934537000},"page":"15-28","source":"Crossref","is-referenced-by-count":4,"title":["A Hamada type characterization of the classical geometric designs"],"prefix":"10.1007","volume":"65","author":[{"given":"Dieter","family":"Jungnickel","sequence":"first","affiliation":[]},{"given":"Vladimir D.","family":"Tonchev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,11]]},"reference":[{"key":"9580_CR1","volume-title":"Design Theory, 2nd edn","author":"T. Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999)"},{"key":"9580_CR2","volume-title":"Introduction to Coding Theory","author":"J. Bierbrauer","year":"2005","unstructured":"Bierbrauer J.: Introduction to Coding Theory. Chapman & Hall, London (2005)"},{"key":"9580_CR3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/S0021-9800(66)80007-8","volume":"1","author":"R.C. Bose","year":"1966","unstructured":"Bose R.C., Burton R.C.: A characterization of flat spaces in a finite geometry and the uniqueness of the Hamming and the MacDonald codes. J. Comb. Theory 1, 96\u2013104 (1966)","journal-title":"J. Comb. Theory"},{"key":"9580_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.jcta.2010.06.007","volume":"118","author":"D. Clark","year":"2011","unstructured":"Clark D., Jungnickel D., Tonchev V.D.: Affine geometry designs, polarities, and Hamada\u2019s conjecture. J. Comb. Theory A 118, 231\u2013239 (2011)","journal-title":"J. Comb. Theory A"},{"key":"9580_CR5","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":"9580_CR6","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ffa.2010.01.002","volume":"16","author":"M. Giorgetti","year":"2010","unstructured":"Giorgetti M., Previtali A.: Galois invariance, trace codes and subfield subcodes. Finite Fields Appl. 16, 96\u201399 (2010)","journal-title":"Finite Fields Appl."},{"key":"9580_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":"9580_CR8","doi-asserted-by":"crossref","unstructured":"Graham R.L., MacWilliams J.: On the number of information symbols in difference-set cyclic codes. Bell Syst. Tech. J. XLV, 1057\u20131070 (1966).","DOI":"10.1002\/j.1538-7305.1966.tb01687.x"},{"key":"9580_CR9","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":"9580_CR10","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. Comb. Theory A 18, 131\u2013140 (1975)","journal-title":"J. Comb. Theory A"},{"key":"9580_CR11","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":"Codes Cryptogr."},{"key":"9580_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10623-008-9249-8","volume":"51","author":"D. Jungnickel","year":"2009","unstructured":"Jungnickel D., Tonchev V.D.: Polarities, quasi-symmetric designs, and Hamada\u2019s conjecture. Des. Codes Cryptogr. 51, 131\u2013140 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"9580_CR13","doi-asserted-by":"crossref","unstructured":"Jurrius R.: Weight enumeration of codes from finite spaces. Des. Codes Cryptogr. (2011). doi: 10.1007\/s10623-011-9557-2 .","DOI":"10.1007\/s10623-011-9557-2"},{"key":"9580_CR14","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/S0019-9958(68)90534-2","volume":"12","author":"F.J. MacWilliams","year":"1968","unstructured":"MacWilliams F.J., Mann H.B.: On the p-rank of the design matrix of a difference set. Inform. Control 12, 474\u2013488 (1968)","journal-title":"Inform. Control"},{"key":"9580_CR15","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"9580_CR16","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. Discret. Math. 308, 2742\u20132750 (2008)","journal-title":"Discret. Math."},{"key":"9580_CR17","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":"9580_CR18","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":"9580_CR19","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0021-9800(69)80046-3","volume":"7","author":"K.J.C. Smith","year":"1969","unstructured":"Smith K.J.C.: On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry. J. Comb. Theory 7, 122\u2013129 (1969)","journal-title":"J. Comb. Theory"},{"key":"9580_CR20","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. Comb. Theory A 28, 290\u2013306 (1980)","journal-title":"J. Comb. Theory A"},{"key":"9580_CR21","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. Comb. Theory A 42, 104\u2013110 (1986)","journal-title":"J. Comb. Theory A"},{"key":"9580_CR22","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."},{"key":"9580_CR23","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1024121012598","volume":"29","author":"V.D. Tonchev","year":"2003","unstructured":"Tonchev V.D.: A note on MDS codes, n-arcs and complete designs. Des. Codes Cryptogr. 29, 247\u2013250 (2003)","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-011-9580-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9580-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9580-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:31Z","timestamp":1559246311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9580-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,11]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9580"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9580-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,11]]}}}