Compressed error and erasure correcting codes via rank-metric codes in random network coding

International Journal of Communication Systems

Volumn 25, Issue 11, 2012, Pages 1398-1414

  Chen, Siguang ^a   Wu, Meng ^b,c   Lu, Weifeng ^b  

^a NANJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b Nanjing University of Posts and Telecommunications   (China)

^c BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

compressed code; decoding; error and erasure; error correction; minimum distance; network coding; rank metric codes; security

Indexed keywords

COMPRESSED CODE; COMPUTATION OVERHEADS; DECODING COMPLEXITY; DECODING PROCESS; DESTINATION NODES; ERASURE CORRECTING; ERASURE CORRECTING CODES; ERROR CONTROL; EXTENSION FIELD; MINIMUM DISTANCE; NUMERICAL RESULTS; PACKET LENGTH; RANDOM NETWORK CODING; RANK-METRIC CODES; SECURITY; SECURITY AND PERFORMANCE;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; ERROR CORRECTION; NETWORK CODING;

DECODING;

EID: 84868195844     PISSN: 10745351     EISSN: 10991131     Source Type: Journal    
DOI: 10.1002/dac.1316     Document Type: Article

References (23)

1. Ahlswede R, Cai N, Li SR, Yeung RW,. Network information flow. IEEE Transactions on Information Theory Jul. 2000; 46 (5): 1204-1216.
2. Li S, Yeung R, Cai N,. Linear network coding. IEEE Transactions on Information Theory Feb. 2003; 49 (2): 371-381.
3. Li Z, Li B,. Network coding: the case of multiple unicast sessions. In In Proceedings of the 42nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, 2004.
4. Chou YWPA, Kung S-Y,. Minimum-energy multicast in mobile ad hoc networks using network coding. IEEE Transactions on Communications Nov. 2005; 53 (11): 1906-1918. (Pubitemid 41763708)
5. Lun DS, Médard M, Koetter R, Effros M,. Further results on coding for reliable communication over packet networks. In Proceedings of IEEE International Symposium on Information Theory (ISIT 2005): Adelaide, SA, 2005; 1848-1852. (Pubitemid 44508364)
6. Dong J, Curtmola R, Nita-Rotaru C,. Secure network coding for wireless mesh networks: Threats, challenges, and directions. Computer Communications Nov. 2009; 32 (17): 1790-1801.
7. Jaggi S, Langberg M, Katti S, Ho T, Katabi D, Medard M,. Resilient network coding in the presence of byzantine adversaries. IEEE Transactions on Information Theory Jun. 2008; 54 (6): 2596-2603.
8. Nutman L, Langberg M,. Adversarial models and resilient schemes for network coding. In Proceedings of IEEE International Symposium on Information Theory (ISIT 2008): Toronto, ON, 2008; 171-175.
9. Aly SA, Kamal AE,. Network coding-based protection strategies against a single link failure in optical networks. In Proceedings of the International Conference on Computer Engineering and Systems (ICCES 2008): Cairo, Egypt, 2008: 251-256.
10. Li S, Ramamoorthy A,. Protection against link errors and failures using network coding in overlay networks. In Proceedings of the IEEE International Symposium on Information Theory (ISIT 2009). IEEE Press: Seoul, Korea, 2009; 986-990.
11. Aly SA, Kamal AE,. Network protection codes against link failures using network coding. In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2008): New Orleans, LA, 2008; 2693-2698.
12. Aly SA, Kamal AE,. Network coding-based protection strategy against node failures. In Proceedings of th IEEE International Conference on Communications (ICC 2009): Dresden, 2009; 1-5.
13. Bahramgiri H, Lahouti F,. Robust network coding against path failures. IET Communications 2010; 4 (3): 272-284.
14. Koetter R, Kschischang FR,. Coding for errors and erasures in random network coding. IEEE Transactions on Information Theory Aug. 2008; 54 (8): 3579-3591.
15. Silva D, Kschischang FR, Koetter R,. A rank-metric approach to error control in random network coding. IEEE Transactions on Information Theory Sep. 2008; 54 (9): 3951-3967.
16. Silva D, Kschischang FR, Koetter R,. Communication over finite-field matrix channels. IEEE Transactions on Information Theory Mar. 2010; 56 (3): 1296-1305.
17. Gabidulin EM, Pilipchuk NI,. Error and erasure correcting algorithms for rank codes. Designs, Codes, and Cryptography Dec. 2008; 49 (1-3): 105-122.
18. Gabidulin EM, Bossert M, Pilipchuk NI,. Correcting generalized matrix erasures with applications to random network coding. In Proceedings of the International ITG Conference on Source and Channel Coding (SCC 2010): Siegen, 2010; 1-7.
19. Jafari M, Keller L, Fragouli C, Argyraki K,. Compressed network coding vectors. In Proceedings of IEEE International Symposium on Information Theory (ISIT 2009): Seoul, Korea, 2009; 109-113.
20. Jiang Y, Fan Y, Shen X, Lin C,. A self-adaptive probabilistic packet filtering scheme against entropy attacks in network coding. Computer Networks Dec. 2009; 53 (18): 3089-3101.
21. Richter G, Plass S,. Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm. ITG-Fachbericht 2004: (181): 203-209.
22. Li S, Ramamoorthy A,. Improved compression of network coding vectors using erasure decoding and list decoding. IEEE Communications Letters Aug. 2010; 14 (8): 749-751.
23. Skachek V, Roth RM,. Probabilistic algorithm for finding roots of linearized polynomials. Designs, Codes, and Cryptography Jan. 2008; 46 (1): 17-23. (Pubitemid 50003986)