메뉴 건너뛰기




Volumn 56, Issue 5, 2010, Pages 2097-2108

Packing and covering properties of subspace codes for error control in random linear network coding

Author keywords

Constant dimension codes (CDCs); Covering; Error control codes; Injection metric; Network coding; Packing; Random linear network coding; Subspace codes; Subspace metric

Indexed keywords

COVERING; ERROR CONTROL CODE; LINEAR NETWORK CODING; NETWORK CODING; SUBSPACE CODES; SUBSPACE METRIC;

EID: 77951613596     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2043780     Document Type: Article
Times cited : (40)

References (22)
  • 3
    • 48849089497 scopus 로고    scopus 로고
    • Coding for errors and erasures in random network coding
    • Aug
    • R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding, " IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.8 , pp. 3579-3591
    • Koetter, R.1    Kschischang, F.R.2
  • 4
    • 77955646467 scopus 로고    scopus 로고
    • On metrics for error correction in network coding
    • Dec
    • D. Silva and F. R. Kschischang, "On metrics for error correction in network coding, " IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5479-5490, Dec. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.12 , pp. 5479-5490
    • Silva, D.1    Kschischang, F.R.2
  • 5
    • 51349146209 scopus 로고    scopus 로고
    • A rank-metric approach to error control in random network coding
    • Sep
    • D. Silva, F. R. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding, " IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3951-3967, Sep. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.9 , pp. 3951-3967
    • Silva, D.1    Kschischang, F.R.2    Koetter, R.3
  • 6
    • 77949505286 scopus 로고    scopus 로고
    • Recursive code construction for random networks
    • Mar. 2010
    • V. Skachek, "Recursive code construction for random networks, " IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1378-1382, Mar. 2010.
    • IEEE Trans. Inf. Theory , vol.56 , Issue.3 , pp. 1378-1382
    • Skachek, V.1
  • 7
    • 70449484486 scopus 로고    scopus 로고
    • Construction and covering properties of constant-dimension codes
    • Online. Available:, submitted for publication
    • M. Gadouleau and Z. Yan, "Construction and covering properties of constant-dimension codes, " IEEE Trans. Inf. Theory, 2009 [Online]. Available: http://arxiv.org/abs/0903.2675, submitted for publication
    • (2009) IEEE Trans. Inf. Theory
    • Gadouleau, M.1    Yan, Z.2
  • 8
    • 58849158404 scopus 로고    scopus 로고
    • Construction of large constant dimension codes with a prescribed minimum distance
    • Berlin, Germany: Springer-Verlag, Dec
    • A. Kohnert and S. Kurz, "Construction of large constant dimension codes with a prescribed minimum distance, " in Mathematical Methods in Computer Science, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, Dec. 2008, vol. 5393, pp. 31-42.
    • (2008) Mathematical Methods in Computer Science, Ser. Lecture Notes in Computer Science , vol.5393 , pp. 31-42
    • Kohnert, A.1    Kurz, S.2
  • 9
    • 67349117683 scopus 로고    scopus 로고
    • Johnson type bounds on constant dimension codes
    • Feb
    • S.-T. Xia and F.-W. Fu, "Johnson type bounds on constant dimension codes, " Designs Codes Cryptogr., vol. 50, no. 2, pp. 163-172, Feb. 2009.
    • (2009) Designs Codes Cryptogr. , vol.50 , Issue.2 , pp. 163-172
    • Xia, S.-T.1    Fu, F.-W.2
  • 10
    • 52349095515 scopus 로고    scopus 로고
    • Error-correcting codes in projective space
    • Toronto, ON, Canada, Jul
    • T. Etzion and A. Vardy, "Error-correcting codes in projective space, " in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, Jul. 2008, pp. 871-875.
    • (2008) Proc. IEEE Int. Symp. Inf. Theory , pp. 871-875
    • Etzion, T.1    Vardy, A.2
  • 11
    • 67650156080 scopus 로고    scopus 로고
    • Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams
    • Jul
    • T. Etzion and N. Silberstein, "Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams, " IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 2909-2919, Jul. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.7 , pp. 2909-2919
    • Etzion, T.1    Silberstein, N.2
  • 13
    • 0004247960 scopus 로고    scopus 로고
    • V. Pless and W. Huffman, Eds., New York: Elsevier
    • V. Pless and W. Huffman, Eds., Handbook of Coding Theory. New York: Elsevier, 1998.
    • (1998) Handbook of Coding Theory
  • 15
    • 0035400640 scopus 로고    scopus 로고
    • Bounds for the multicovering radii of Reed-Muller codes with applications to stream ciphers
    • Jul
    • I. Honkala and A. Klapper, "Bounds for the multicovering radii of Reed-Muller codes with applications to stream ciphers, " Designs Codes Cryptogr., vol. 23, no. 2, pp. 131-145, Jul. 2001.
    • (2001) Designs Codes Cryptogr. , vol.23 , Issue.2 , pp. 131-145
    • Honkala, I.1    Klapper, A.2
  • 16
    • 0004100864 scopus 로고
    • G.-C. Rota, Ed. Reading, MA: Addison-Wesley, Encyclopedia of Mathematics and its Applications
    • G. E. Andrews, The Theory of Partitions, G.-C. Rota, Ed. Reading, MA: Addison-Wesley, 1976, vol. 2, Encyclopedia of Mathematics and its Applications.
    • (1976) The Theory of Partitions , vol.2
    • Andrews, G.E.1
  • 17
    • 46749089110 scopus 로고    scopus 로고
    • On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes
    • Jul
    • M. Gadouleau and Z. Yan, "On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes, " IEEE Trans. Inf. Theory, vol. 54, no. 7, pp. 3202-3206, Jul. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.7 , pp. 3202-3206
    • Gadouleau, M.1    Yan, Z.2
  • 18
    • 0004216016 scopus 로고    scopus 로고
    • 2nd ed. Cambridge, U. K.: Cambridge Univ. Press, Encyclopedia of Mathematics and its Applications
    • G. Gasper and M. Rahman, Basic Hypergeometric Series, 2nd ed. Cambridge, U. K.: Cambridge Univ. Press, 2004, vol. 96, Encyclopedia of Mathematics and its Applications.
    • (2004) Basic Hypergeometric Series , vol.96
    • Gasper, G.1    Rahman, M.2
  • 20
    • 51349126250 scopus 로고    scopus 로고
    • Packing and covering properties of rank metric codes
    • Sep
    • M. Gadouleau and Z. Yan, "Packing and covering properties of rank metric codes, " IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3873-3883, Sep. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.9 , pp. 3873-3883
    • Gadouleau, M.1    Yan, Z.2
  • 21
    • 53249111734 scopus 로고    scopus 로고
    • Tight upper bounds for the domination numbers of graphs with given order and minimum degree
    • W. E. Clark and L. A. Dunning, "Tight upper bounds for the domination numbers of graphs with given order and minimum degree, " Electron. J. Combinatorics, vol. 4, 1997.
    • (1997) Electron. J. Combinatorics , vol.4
    • Clark, W.E.1    Dunning, L.A.2
  • 22
    • 70350409985 scopus 로고    scopus 로고
    • Bounds on covering codes with the rank metric
    • Sep
    • M. Gadouleau and Z. Yan, "Bounds on covering codes with the rank metric, " IEEE Commun. Lett., vol. 13, no. 9, pp. 691-693, Sep. 2009.
    • (2009) IEEE Commun. Lett. , vol.13 , Issue.9 , pp. 691-693
    • Gadouleau, M.1    Yan, Z.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.