乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T01:29:09Z","timestamp":1722302949145},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T00:00:00Z","timestamp":1482364800000},"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":["Combinatorica"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00493-016-3354-5","type":"journal-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T01:28:37Z","timestamp":1482370117000},"page":"1073-1095","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Subspace Codes in PG(2N \u2212 1, Q)"],"prefix":"10.1007","volume":"37","author":[{"given":"Antonio","family":"Cossidente","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Pavese","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,22]]},"reference":[{"key":"3354_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01215286","volume":"145","author":"A. Beutelspacher","year":"1975","unstructured":"A. Beutelspacher: Partial spreads in finite projective spaces and partial designs, Math. Z.\n 145 (1975), 211\u2013229.","journal-title":"Math. Z."},{"key":"3354_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01230599","volume":"33","author":"J. M. N. Brown","year":"1988","unstructured":"J. M. N. Brown: Partitioning the complement of a simplex in PG(e,q\n d+1) into copies of PG(d,q), J. Geom.\n 33 (1988), 11\u201316.","journal-title":"J. Geom."},{"key":"3354_CR3","doi-asserted-by":"crossref","unstructured":"A. Cossidente and F. Pavese: On subspace codes, Des. Codes Cryptogr. DOI 10.1007\/s10623-014-0018-6.","DOI":"10.1007\/s10623-014-0018-6"},{"key":"3354_CR4","doi-asserted-by":"crossref","unstructured":"A. Cossidente, G. Marino and F. Pavese: Non-linear maximum rank distance codes, Des. Codes Cryptogr. DOI 10.1007\/s10623-015-0108-0.","DOI":"10.1007\/s10623-015-0108-0"},{"key":"3354_CR5","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P. Delsarte","year":"1978","unstructured":"P. Delsarte: Bilinear forms over a finite field, with applications to coding theory, J. Combin. Theory Ser. A\n 25 (1978), 226\u2013241.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3354_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01759298","volume":"158","author":"R. H. Dye","year":"1991","unstructured":"R. H. Dye: Spreads and classes of maximal subgroups of GL(n,q), SL(n,q), PGL(n,q) and PSL(n,q), Ann. Mat. Pura Appl.\n 158 (1991), 33\u201350.","journal-title":"Ann. Mat. Pura Appl."},{"key":"3354_CR7","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1109\/TIT.2012.2220119","volume":"59","author":"T. Etzion","year":"2013","unstructured":"T. Etzion and N. Silberstein: Codes and Designs Related to Lifted MRD Codes, IEEE Trans. Inform. Theory\n 59 (2013), 1004\u20131017.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3354_CR8","doi-asserted-by":"publisher","first-page":"2909","DOI":"10.1109\/TIT.2009.2021376","volume":"55","author":"T. Etzion","year":"2009","unstructured":"T. Etzion and N. Silberstein: Error-correcting codes in projective spaces via rankmetric codes and Ferrers diagrams, IEEE Trans. Inform. Theory\n 55 (2009), 2909\u20132919.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3354_CR9","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TIT.2010.2095232","volume":"57","author":"T. Etzion","year":"2011","unstructured":"T. Etzion and A. Vardy: Error-correcting codes in projective space, IEEE Trans. Inform. Theory\n 57 (2011), 1165\u20131173.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3354_CR10","first-page":"1","volume":"21","author":"E. M. Gabidulin","year":"1985","unstructured":"E. M. Gabidulin: Theory of codes with maximum rank distance, Problems of Information Transmission\n 21 (1985), 1\u201312.","journal-title":"Problems of Information Transmission"},{"key":"3354_CR11","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1109\/TIT.2010.2048447","volume":"56","author":"M. Gadouleau","year":"2010","unstructured":"M. Gadouleau and Z. Yan: Constant-rank codes and their connection to constant-dimension codes, IEEE Trans. Inform. Theory\n 56 (2010), 3207\u20133216.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3354_CR12","first-page":"175","volume":"36","author":"N. Gill","year":"2007","unstructured":"N. Gill: Polar spaces and embeddings of classical groups, New Zealand J. Math.\n 36 (2007), 175\u2013184.","journal-title":"New Zealand J. Math."},{"key":"3354_CR13","volume-title":"Finite projective spaces of three dimensions","author":"J. W. P. Hirschfeld","year":"1985","unstructured":"J. W. P. Hirschfeld: Finite projective spaces of three dimensions, Oxford Mathematical Monographs, Oxford Science Publications, The Clarendon Press, Oxford University Press, New York, 1985."},{"key":"3354_CR14","volume-title":"General Galois Geometries","author":"J. W. P. Hirschfeld","year":"1991","unstructured":"J. W. P. Hirschfeld and J. A. Thas: General Galois Geometries, Oxford Mathematical Monographs, Oxford Science Publications, The Clarendon Press, Oxford University Press, New York, 1991."},{"key":"3354_CR15","first-page":"157","volume-title":"Topics in finite fields","author":"T. Honold","year":"2015","unstructured":"T. Honold, M. Kiermaier and S. Kurz: Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4, Topics in finite fields 157\u2013176, Contemp. Math. 632, Amer. Math. Soc., Providence, RI, 2015."},{"key":"3354_CR16","volume-title":"Endliche Gruppen I, Die Grundlehren der Mathematischen Wissenschaften","author":"B. Huppert","year":"1967","unstructured":"B. Huppert: Endliche Gruppen I, Die Grundlehren der Mathematischen Wissenschaften, Springer-Verlag, Berlin-New York, 1967."},{"key":"3354_CR17","volume-title":"Cryptography and coding","author":"A. Khaleghi","year":"2009","unstructured":"A. Khaleghi, D. Silva and F. R. Kschischang: Subspace codes, Cryptography and coding\n 1\u201321, Lecture Notes in Comput. Sci., Springer, Berlin, 2009."},{"key":"3354_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629235","volume-title":"The subgroup structure of the finite classical groups","author":"P. Kleidman","year":"1990","unstructured":"P. Kleidman and M. Liebeck: The subgroup structure of the finite classical groups, London Mathematical Society Lecture Note Series, vol. 129, Cambridge University Press, Cambridge, 1990."},{"key":"3354_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1515\/advgeom.2010.007","volume":"10","author":"A. Klein","year":"2010","unstructured":"A. Klein, K. Metsch and L. Storme: Small maximal partial spreads in classical finite polar spaces, Adv. Geom.\n 10 (2010), 379\u2013402.","journal-title":"Adv. Geom."},{"key":"3354_CR20","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R. Koetter","year":"2008","unstructured":"R. Koetter and F. R. Kschischang: Coding for errors and erasures in random network coding, IEEE Trans. Inform. Theory\n 54 (2008), 3579\u20133591.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3354_CR21","first-page":"271","volume-title":"Topics in finite fields","author":"M. Lavrauw","year":"2015","unstructured":"M. Lavrauw and G. Van de Voorde: Field reduction and linear sets in finite geometry, Topics in finite fields, 271\u2013293, Contemp. Math., 632, Amer. Math. Soc., Providence, RI, 2015."},{"key":"3354_CR22","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/s10801-013-0468-3","volume":"39","author":"G. Lunardon","year":"2014","unstructured":"G. Lunardon, G. Marino, O. Polverino and R. Trombetti: Maximum scattered linear sets of pseudoregulus type and the Segre Variety Sn;n, J. Algebr. Comb.\n 39 (2014), 807\u2013831.","journal-title":"J. Algebr. Comb."},{"key":"3354_CR23","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"R. M. Roth","year":"1991","unstructured":"R. M. Roth: Maximum-rank array codes and their application to crisscross error correction, IEEE Trans. Inform. Theory\n 37 (1991), 328\u2013336.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3354_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02410047","volume":"64","author":"B. Segre","year":"1964","unstructured":"B. Segre: Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane, Ann. Mat. Pura Appl.\n 64 (1964), 1\u201376.","journal-title":"Ann. Mat. Pura Appl."},{"key":"3354_CR25","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D. Silva","year":"2008","unstructured":"D. Silva, F. R. Kschischang and R. Koetter: A rank-metric approach to error control in random network coding, IEEE Trans. Inform. Theory,\n 54 (2008), 3951\u20133967.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3354_CR26","first-page":"405","volume-title":"Proc. of Int. Symp. on Math. Theory of Networks and Systems","author":"A.-L. Trautmann","year":"2010","unstructured":"A.-L. Trautmann and J. Rosenthal: New improvements on the echelon-Ferrers construction, in: Proc. of Int. Symp. on Math. Theory of Networks and Systems, 405\u2013408, 2010."},{"key":"3354_CR27","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10623-008-9221-7","volume":"50","author":"S.-T. Xia","year":"2009","unstructured":"S.-T. Xia and F.-W. Fu: Johnson type bounds on constant dimension codes, Des. Codes Cryptogr.\n 50 (2009), 163\u2013172.","journal-title":"Des. Codes Cryptogr."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3354-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3354-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3354-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T06:04:37Z","timestamp":1544767477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3354-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,22]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["3354"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3354-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,22]]}}}