Subspace codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5921 LNCS, Issue , 2009, Pages 1-21

  Khaleghi, Azadeh ^a   Silva, Danilo ^a   Kschischang, Frank R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODE-WORDS; DISTANCE MEASURE; ENCODING AND DECODING; LINEAR NETWORK CODING; METRIC CODES; SUBSPACE CODES;

CRYPTOGRAPHY;

EID: 72549111734     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10868-6_1     Document Type: Conference Paper

References (29)

1. Kötter, R., Kschischang, F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579-3591 (2008)
2. Silva, D., Kschischang, F.R.: On metrics for error correction in network coding. IEEE Trans. Inf. Theory (to appear 2009)
3. Silva, D., Kschischang, F.R., Kötter, R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inf. Theory 54(9), 3951-3967 (2008)
4. Silva, D., Kschischang, F.R.: Universal secure network coding via rank-metric codes. IEEE Trans. Inf. Theory (2008) (submitted for publication)
5. Katti, S., Katabi, D., Balakrishnan, H., Médard, M.: Symbol-level network coding for wireless mesh networks. In: ACM SIGCOMM, Seattle, WA (August 2008)
6. Wang, H., Xing, C., Safavi-Naini, R.: Linear authentication codes: bounds and constructions. IEEE Trans. Inf. Theory 49(4), 866-872 (2003)
7. Xia, S.T., Fu, F.W.: Johnson type bounds on constant dimension codes. Designs, Codes and Cryptography 50(2), 163-172 (2009)
8. Borel, A.: Linear Algebraic Groups. In: Grad. Texts Math., 2nd edn., vol. 126. Springer, Heidelberg (1991)
9. Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer, New York (1989)
10. van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)
11. Gabidulin, E.M.: Theory of codes with maximum rank distance. Probl. Inform. Transm. 21(1), 1-12 (1985)
12. Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. of Comb. Theory. Series A 25, 226-241 (1978)
13. Loidreau, P.: Étude et optimisation de cryptosystèmes à clépublique fondés sur la théorie des codes correcteurs. Ph.d. dissertation, École Polytechnique, Paris, France (May 2001)
14. Gadouleau, M., Yan, Z.: Packing and covering properties of cdcs and subspace codes. IEEE Trans. on Inform. Theory (2008) (Submitted)
15. Delsarte, P.: An algebraic approach to association schemes of coding theory. Philips J. Res., 1-97 (1973)
16. Frankl, P., Wilson, R.: The Erdös-Ko-Rado Theorem for Vector Spaces. Journal of Combinatorial Theory 43, 228-236 (1986)
17. Etzion, T., Vardy, A.: Error-correcting codes in projective space. In: Proc. IEEE Int. Symp. Information Theory, Toronto, Canada, July 6-11, pp. 871-875 (2008)
18. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
19. Ahlswede, R., Aydinian, H.: On error control for random network coding. In: IEEE Workshop on Network Coding, Theory and Applications (2009)
20. 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-12 (2009)
21. Tolhuizen, L.M.G.M.: The generalized Gilbert-Varshamov bound is implied by Túran's theorem. IEEE Trans. Inf. Theory 43(5), 1605-1606 (1997)
22. Silva, D.: Error Control for Network Coding. PhD thesis, University of Toronto, Toronto, Canada (2009)
23. Skachek, V.: Recursive code construction for random networks. Submitted for Publication (2008)
24. 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-885 (2008)
25. Gabidulin, E., Bossert, M.: Codes for network coding. In: Proc. IEEE Int. Symp. Information Theory, Toronto, Canada, July 6-11, pp. 867-870 (2008)
26. Etzion, T., Silberstein, N.: Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams. IEEE Trans. Inf. Theory 55(7), 2909-2919 (2009)
27. Khaleghi, A.: Projective space codes for the injection metric. Master's thesis, University of Toronto, Toronto, Canada (2009)
28. 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-42 (2008)
29. 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-2862 (2009)