Construction and covering properties of constant-dimension codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2221-2225

  Gadouleau, Maximilien ^a   Yan, Zhiyuan ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC BEHAVIORS; CARDINALITIES; COVERING RADIUS; DECODING ALGORITHM; DERIVE BOUNDS; LOW-COMPLEXITY; MINIMUM DISTANCE; NON-COHERENT; OPEN PROBLEMS; OPTIMAL PACKING; RANDOM NETWORK CODING; RANK METRIC CODES; SUBSPACE DISTANCE;

DECODING; INFORMATION THEORY; OPTIMIZATION; SIGNAL ENCODING;

ERROR CORRECTION;

EID: 70449484486     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205850     Document Type: Conference Paper

References (22)

1. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Info. Theory, vol. 54, no. 8, pp. 3579-3591, August 2008.
2. D. Silva and F. R. Kschischang, "On metrics for error correction in network coding," 2008, available at http://arxiv.org/abs/0805.3824v1.
3. V. Skachek, "Recursive code construction for random networks," 2008, available at http://arxiv.org/abs/0806.3650v1.
4. A. Kohnert and S. Kurz, "Construction of large constant dimension codes with a prescribed minimum distance," Mathematical Methods in Computer Science, LNCS, vol. 5393, pp. 31-42, December 2008.
5. S.-T. Xia and F.-W. Fu, "Johnson type bounds on constant dimension codes," Designs, Codes and Cryptography, vol. 50, no. 2, pp. 163-172, February 2009.
6. G. D. Cohen, I. Honkala, S. Litsyn, and A. C. Lobstein, Covering Codes. Elsevier, 1997.
7. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression, ser. Information and System Sciences Series, T. Kailath, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1971.
8. M. Gadouleau and Z. Yan, "Construction and covering properties of constant-dimension codes," submitted to IEEE Trans. Info. Theory, 2009, available at http://arxiv.org/abs/0903.2675.
9. P. Delsarte, "Association schemes and t-designs in regular semilattices," Journal of Combinatorial Theory A, vol. 20, no. 2, pp. 230-243, March 1976.
10. G. E. Andrews, The Theory of Partitions, ser. Encyclopedia of Mathematics and its Applications, G.-C. Rota, Ed. Reading, MA: Addison-Wesley, 1976, vol. 2.
11. M. Gadouleau and Z. Yan, "On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes," IEEE Trans. Info. Theory, vol. 54, no. 7, pp. 3202-3206, July 2008.
12. E. M. Gabidulin and M. Bossert, "Codes for network coding," in Proc. IEEE Int. Symp. on Information Theory, Toronto, ON, July 2008, pp. 867-870.
13. P. Delsarte, "Bilinear forms over a finite field, with applications to coding theory," Journal of Combinatorial Theory A, vol. 25, no. 3, pp. 226-241, November 1978.
14. E. M. Gabidulin, "Theory of codes with maximum rank distance," Problems of Information Transmission, vol. 21, no. 1, pp. 1-12, January 1985.
15. R. M. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. Info. Theory, vol. 37, no. 2, pp. 328-336, March 1991.
16. M. Gadouleau and Z. Yan, "Packing and covering properties of rank metric codes," IEEE Trans. Info. Theory, vol. 54, no. 9, pp. 3873-3883, September 2008.
17. -, "Bounds on covering codes with the rank metric," submitted to IEEE Communications Letters, September 2008, available at http://arxiv.org/abs/0809.2968.
18. D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding," IEEE Trans. Info. Theory, vol. 54, no. 9, pp. 3951-3967, September 2008.
19. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs, ser. A Series of Modern Surveys in Mathematics. Springer- Verlag, 1989, vol. 18, no. 3.
20. kF(i; k; n)," SIAM Journal of Applied Mathematics, vol. 31, no. 2, pp. 262-270, September 1976.
21. E. Bannai and T. Ito, Algebraic Cominatorics I. Association Schemes. The Benjamin/Cummings Publishing Company, 1983.
22. W. E. Clark and L. A. Dunning, "Tight upper bounds for the domination numbers of graphs with given order and minimum degree," The Electronic Journal of Combinatorics, vol. 4, 1997.