{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T22:42:03Z","timestamp":1781476923993,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642108679","type":"print"},{"value":"9783642108686","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10868-6_1","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T00:17:15Z","timestamp":1259713035000},"page":"1-21","source":"Crossref","is-referenced-by-count":33,"title":["Subspace Codes"],"prefix":"10.1007","author":[{"given":"Azadeh","family":"Khaleghi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danilo","family":"Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"8","key":"1_CR1","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R. K\u00f6tter","year":"2008","unstructured":"K\u00f6tter, R., Kschischang, F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory\u00a054(8), 3579\u20133591 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Silva, D., Kschischang, F.R.: On metrics for error correction in network coding. IEEE Trans. Inf. Theory (to appear 2009)","DOI":"10.1109\/TIT.2009.2032817"},{"issue":"9","key":"1_CR3","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D. Silva","year":"2008","unstructured":"Silva, D., Kschischang, F.R., K\u00f6tter, R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inf. Theory\u00a054(9), 3951\u20133967 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Silva, D., Kschischang, F.R.: Universal secure network coding via rank-metric codes. IEEE Trans. Inf. Theory (2008) (submitted for publication)","DOI":"10.1109\/ISIT.2008.4594971"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Katti, S., Katabi, D., Balakrishnan, H., M\u00e9dard, M.: Symbol-level network coding for wireless mesh networks. In: ACM SIGCOMM, Seattle, WA (August 2008)","DOI":"10.1145\/1402958.1403004"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/TIT.2003.809567","volume":"49","author":"H. Wang","year":"2003","unstructured":"Wang, H., Xing, C., Safavi-Naini, R.: Linear authentication codes: bounds and constructions. IEEE Trans. Inf. Theory\u00a049(4), 866\u2013872 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10623-008-9221-7","volume":"50","author":"S.T. Xia","year":"2009","unstructured":"Xia, S.T., Fu, F.W.: Johnson type bounds on constant dimension codes. Designs, Codes and Cryptography\u00a050(2), 163\u2013172 (2009)","journal-title":"Designs, Codes and Cryptography"},{"key":"1_CR8","volume-title":"Grad. Texts Math.","author":"A. Borel","year":"1991","unstructured":"Borel, A.: Linear Algebraic Groups. In: Grad. Texts Math., 2nd edn., vol.\u00a0126. Springer, Heidelberg (1991)","edition":"2"},{"key":"1_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"A.E. Brouwer","year":"1989","unstructured":"Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer, New York (1989)"},{"key":"1_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics","author":"J.H. Lint van","year":"2001","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"issue":"1","key":"1_CR11","first-page":"1","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Probl. Inform. Transm.\u00a021(1), 1\u201312 (1985)","journal-title":"Probl. Inform. Transm."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P. Delsarte","year":"1978","unstructured":"Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. of Comb. Theory. Series A\u00a025, 226\u2013241 (1978)","journal-title":"J. of Comb. Theory. Series A"},{"key":"1_CR13","unstructured":"Loidreau, P.: \u00c9tude et optimisation de cryptosyst\u00e8mes \u00e0 cl\u00e9 publique fond\u00e9s sur la th\u00e9orie des codes correcteurs. Ph.d. dissertation, \u00c9cole Polytechnique, Paris, France (May 2001)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Gadouleau, M., Yan, Z.: Packing and covering properties of cdcs and subspace codes. IEEE Trans. on Inform. Theory (2008) (Submitted)","DOI":"10.1109\/TIT.2008.928284"},{"key":"1_CR15","unstructured":"Delsarte, P.: An algebraic approach to association schemes of coding theory. Philips J. Res., 1\u201397 (1973)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/0097-3165(86)90063-4","volume":"43","author":"P. Frankl","year":"1986","unstructured":"Frankl, P., Wilson, R.: The Erd\u00f6s-Ko-Rado Theorem for Vector Spaces. Journal of Combinatorial Theory\u00a043, 228\u2013236 (1986)","journal-title":"Journal of Combinatorial Theory"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Etzion, T., Vardy, A.: Error-correcting codes in projective space. In: Proc. IEEE Int. Symp. Information Theory, Toronto, Canada, July 6-11, pp. 871\u2013875 (2008)","DOI":"10.1109\/ISIT.2008.4595111"},{"key":"1_CR18","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":"1_CR19","doi-asserted-by":"crossref","unstructured":"Ahlswede, R., Aydinian, H.: On error control for random network coding. In: IEEE Workshop on Network Coding, Theory and Applications (2009)","DOI":"10.1109\/NETCOD.2009.5191396"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Khaleghi, A., Kschischang, F.R.: Projective space codes for the injection metric. In: Proc. 11th Canadian Workshop Inform. Theory, Ottawa, May 13-15, pp. 9\u201312 (2009)","DOI":"10.1109\/CWIT.2009.5069509"},{"issue":"5","key":"1_CR21","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1109\/18.623158","volume":"43","author":"L.M.G.M. Tolhuizen","year":"1997","unstructured":"Tolhuizen, L.M.G.M.: The generalized Gilbert-Varshamov bound is implied by T\u00faran\u2019s theorem. IEEE Trans. Inf. Theory\u00a043(5), 1605\u20131606 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR22","unstructured":"Silva, D.: Error Control for Network Coding. PhD thesis, University of Toronto, Toronto, Canada (2009)"},{"key":"1_CR23","unstructured":"Skachek, V.: Recursive code construction for random networks. Submitted for Publication (2008)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Manganiello, F., Gorla, E., Rosenthal, J.: Spread codes and spread decoding in network coding. In: Proc. IEEE Int. Symp. Information Theory, Toronto, Canada, July 6-11, pp. 881\u2013885 (2008)","DOI":"10.1109\/ISIT.2008.4595113"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Gabidulin, E., Bossert, M.: Codes for network coding. In: Proc. IEEE Int. Symp. Information Theory, Toronto, Canada, July 6-11, pp. 867\u2013870 (2008)","DOI":"10.1109\/ISIT.2008.4595110"},{"issue":"7","key":"1_CR26","doi-asserted-by":"publisher","first-page":"2909","DOI":"10.1109\/TIT.2009.2021376","volume":"55","author":"T. Etzion","year":"2009","unstructured":"Etzion, T., Silberstein, N.: Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams. IEEE Trans. Inf. Theory\u00a055(7), 2909\u20132919 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Khaleghi, A.: Projective space codes for the injection metric. Master\u2019s thesis, University of Toronto, Toronto, Canada (2009)","DOI":"10.1109\/CWIT.2009.5069509"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Kohnert, A., Kurz, S.: Construction of large constant dimension codes with a prescribed minimum distance. Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth, 31\u201342 (2008)","DOI":"10.1007\/978-3-540-89994-5_4"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Silva, D., Kschischang, F.R.: Fast encoding and decoding of Gabidulin codes. In: Proc. IEEE Int. Symp. Information Theory, Seoul, Korea, June 28-July 3, pp. 2858\u20132862 (2009)","DOI":"10.1109\/ISIT.2009.5205272"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10868-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:36:03Z","timestamp":1606167363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10868-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108679","9783642108686"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10868-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}