{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:11:52Z","timestamp":1773231112703,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540899938","type":"print"},{"value":"9783540899945","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89994-5_4","type":"book-chapter","created":{"date-parts":[[2008,12,8]],"date-time":"2008-12-08T00:41:38Z","timestamp":1228696898000},"page":"31-42","source":"Crossref","is-referenced-by-count":75,"title":["Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance"],"prefix":"10.1007","author":[{"given":"Axel","family":"Kohnert","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Sascha","family":"Kurz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1023\/A:1008394205999","volume":"22","author":"R. Ahlswede","year":"2001","unstructured":"Ahlswede, R., Aydinian, H.K., Khachatrian, L.H.: On perfect codes and related concepts. Des. Codes Cryptography\u00a022(3), 221\u2013237 (2001)","journal-title":"Des. Codes Cryptography"},{"key":"4_CR2","volume-title":"Algorithms and Computation in Mathematics 18","author":"A. Betten","year":"2006","unstructured":"Betten, A., Braun, M., Fripertinger, H., Kerber, A., Kohnert, A., Wassermann, A.: Error-correcting linear codes. Classification by isometry and applications. With CD-ROM. In: Algorithms and Computation in Mathematics 18, p. xxix, 798. Springer, Berlin (2006)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-60114-7_10","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"A. Betten","year":"1995","unstructured":"Betten, A., Kerber, A., Kohnert, A., Laue, R., Wassermann, A.: The discovery of simple 7-designs with automorphism group P\u0393 L(2,32). In: Giusti, M., Cohen, G., Mora, T. (eds.) AAECC 1995. LNCS, vol.\u00a0948, pp. 131\u2013145. Springer, Heidelberg (1995)"},{"issue":"8","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1109\/TIT.2004.831742","volume":"50","author":"M. Braun","year":"2004","unstructured":"Braun, M.: Construction of linear codes with large minimum distance. IEEE Transactions on Information Theory\u00a050(8), 1687\u20131691 (2004)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"4_CR5","doi-asserted-by":"publisher","first-page":"4247","DOI":"10.1109\/TIT.2005.859291","volume":"51","author":"M. Braun","year":"2005","unstructured":"Braun, M., Kohnert, A., Wassermann, A.: Optimal linear codes from matrix groups. IEEE Transactions on Information Theory\u00a051(12), 4247\u20134251 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR6","first-page":"58","volume":"74","author":"M. Braun","year":"2005","unstructured":"Braun, M.: Some new designs over finite fields. Bayreuther Math. Schr.\u00a074, 58\u201368 (2005)","journal-title":"Bayreuther Math. Schr."},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10623-003-4194-z","volume":"34","author":"M. Braun","year":"2005","unstructured":"Braun, M., Kerber, A., Laue, R.: Systematic construction of q-analogs of t-(v,k,\u03bb)-designs. Des. Codes Cryptography\u00a034(1), 55\u201370 (2005)","journal-title":"Des. Codes Cryptography"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.2140\/iig.2005.1.133","volume":"1","author":"M. Braun","year":"2005","unstructured":"Braun, M., Kohnert, A., Wassermann, A.: Construction of (n,r)-arcs in PG(2,q). Innov. Incidence Geom.\u00a01, 133\u2013141 (2005)","journal-title":"Innov. Incidence Geom."},{"issue":"1","key":"4_CR9","first-page":"10","volume":"9","author":"K. Drudge","year":"2002","unstructured":"Drudge, K.: On the orbits of Singer groups and their subgroups. Electronic Journal Comb.\u00a09(1), 10 p. (2002)","journal-title":"Electronic Journal Comb."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Etzion, T., Silberstein, N.: Construction of error-correcting codes for random network coding (submitted, 2008) (in arXiv 0805.3528)","DOI":"10.1109\/EEEI.2008.4736654"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Etzion, T., Vardy, A.: Error-Correcting codes in projective space. In: ISIT Proceedings, 5 p. (2008)","DOI":"10.1109\/ISIT.2008.4595111"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Gadouleau, M., Yan, Z.: Constant-rank codes and their connection to constant-dimension codes (submitted, 2008) (in arXiv 0803.2262)","DOI":"10.1109\/ISIT.2008.4595112"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"K\u00f6tter, R., Kschischang, F.: Coding for errors and erasures in random network coding. IEEE Transactions on Information Theory\u00a054(8), 3579\u20133391 (2008)","DOI":"10.1109\/TIT.2008.926449"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0012-365X(76)90030-3","volume":"15","author":"E.S. Kramer","year":"1976","unstructured":"Kramer, E.S., Mesner, D.M.: t-designs on hypergraphs. Discrete Math.\u00a015, 263\u2013296 (1976)","journal-title":"Discrete Math."},{"issue":"5-6","key":"4_CR15","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.disc.2007.07.045","volume":"308","author":"T. Maruta","year":"2008","unstructured":"Maruta, T., Shinohara, M., Takenaka, M.: Constructing linear codes from some orbits of projectivities. Discrete Math.\u00a0308(5-6), 832\u2013841 (2008)","journal-title":"Discrete Math."},{"key":"4_CR16","unstructured":"Niskanen, S., \u00d6sterg\u00e5rd, P.R.J.: Cliquer user\u2019s guide, version 1.0. Technical Report T48, Communications Laboratory, Helsinki University of Technology, Espoo, Finland (2003)"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jcta.2001.3188","volume":"97","author":"M. Schwartz","year":"2002","unstructured":"Schwartz, M., Etzion, T.: Codes and anticodes in the Grassman graph. J. Comb. Theory, Ser. A\u00a097(1), 27\u201342 (2002)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"4_CR18","unstructured":"Silberstein, N.: Coding theory in projective space. Ph.D. proposal (2008) (in arXiv 0805.3528)"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00150939","volume":"24","author":"S. Thomas","year":"1987","unstructured":"Thomas, S.: Designs over finite fields. Geom. Dedicata\u00a024, 237\u2013242 (1987)","journal-title":"Geom. Dedicata"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF00181415","volume":"63","author":"S. Thomas","year":"1996","unstructured":"Thomas, S.: Designs and partial geometries over finite fields. Geom. Dedicata\u00a063(3), 247\u2013253 (1996)","journal-title":"Geom. Dedicata"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Tonchev, V.D.: Quantum codes from caps. Discrete Math. (to appear, 2008)","DOI":"10.1016\/j.disc.2007.12.007"},{"key":"4_CR22","first-page":"1","volume":"73","author":"A. Wassermann","year":"2006","unstructured":"Wassermann, A.: Lattice point enumeration and applications. Bayreuther Math. Schr.\u00a073, 1\u2013114 (2006)","journal-title":"Bayreuther Math. Schr."},{"key":"4_CR23","unstructured":"Xia, S.-T., Fu, F.-W.: Johnson type bounds on constant dimension codes (submitted, 2007) (in arXiv 0709.1074)"},{"issue":"5","key":"4_CR24","doi-asserted-by":"publisher","first-page":"2388","DOI":"10.1109\/TIT.2008.920323","volume":"54","author":"J. Zwanzger","year":"2008","unstructured":"Zwanzger, J.: A heuristic algorithm for the construction of good linear codes. IEEE Transactions on Information Theory\u00a054(5), 2388\u20132392 (2008)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89994-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T21:58:20Z","timestamp":1557957500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89994-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899938","9783540899945"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89994-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}