Projective space codes for the injection metric

2009 11th Canadian Workshop on Information Theory, CWIT 2009

Volumn , Issue , 2009, Pages 9-12

  Khaleghi, Azadeh ^a   Kschischang, Frank R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODE-WORDS; ERROR CONTROL; FINITE FIELDS; GILBERT-VARSHAMOV BOUND; LINEAR NETWORK CODING; PROJECTIVE SPACES; SUBSPACE METRIC; VECTOR SPACES;

TOPOLOGY;

INFORMATION THEORY;

EID: 70349925665     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CWIT.2009.5069509     Document Type: Conference Paper

References (16)

1. T. Etzion and A. Vardy, "Error-correcting codes in projective space," IEEE Intern. Symp. on Inform. Theory, pp. 871-875, July 2008.
2. E. Gabidulin and M. Bossert, "Codes for network coding," IEEE Intern. Symp. on Inform. Theory, pp. 867-870, July 2008.
3. F. Manganiello, E. Gorla, and J. Rosenthal, "Spread codes and spread decoding in network coding," IEEE Intern. Symp. on Inform. Theory, pp. 881-885, July 2008.
4. A. Kohnert and S. Kurz, "Construction of large constant dimension codes with a prescribed minimum distance," in MMICS, 2008, pp. 31-42.
5. R. Kötter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. on Inform. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
6. D. Silva, F. R. Kschischang, and R. Kötter, "A rank-metric approach to error correction in random network coding," IEEE Trans. on Inform. Theory, vol. 54, pp. 3951-3967, Sep. 2008.
7. D. Silva and F. R. Kschischang, "On metrics for error correction in network coding," 2008, submitted for publication. [Online]. Available: http://arxiv.org/abs/0805.3824
8. Tuvi Etzion and N. Silberstein, "Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams," 2009. [Online]. Available: http://arxiv.org/abs/0807.4846v4
9. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inform. Transm, vol. 21, no. 1, pp. 1-12, 1985.
10. R. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. on Inform. Theory, vol. 37, no. 2, pp. 328-336, Mar 1991.
11. G. Richter and S. Plass, "Fast decoding of rank-codes with rank errors and column erasures," IEEE Intern. Symp. on Inform. Theory, 2004.
12. P. Loidreau, "A Welch-Berlekamp like algorithm for decoding Gabidulin codes," in WCC, 2005, pp. 36-45.
13. L. Tolhuizen, "The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]," IEEE Trans. on Inform. Theory, vol. 43, no. 5, pp. 1605-1606, Sep 1997.
14. R. Varshamov, "A class of codes for asymmetric channels and a problem from the additive theory of numbers," IEEE Trans. on Inform. Theory, vol. 19, no. 1, pp. 92-95, Jan 1973.
15. T. Kløve, "Error correction codes for the asymmetric channel," Math. Inst. Univ. Bergen, Tech. Rep., 1981.
16. V. P. Shilo, "New lower bounds of the size of error-correcting codes for the Z-channel," Cybernetics and Sys. Anal., vol. 38, pp. 13-16, 2002.