Network-error correcting codes using small fields

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 1930-1934

  Prasad, K ^a   Rajan, B Sundar ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; ALTERNATE METHOD; BRUTE FORCE; CODING ALGORITHMS; CONSTRUCTION ALGORITHMS; COPRIME; CORRECTING CODES; FIELD SIZE; IRREDUCIBLE POLYNOMIALS; LARGE NETWORKS; MULTICASTS; NETWORK CODES; VECTOR NETWORKS;

ALGORITHMS; ERROR CORRECTION; INFORMATION THEORY; POLYNOMIALS;

NETWORK CODING;

EID: 80054814057     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033888     Document Type: Conference Paper

References (16)

1. R. Ahlswede, N. Cai, R. Li and R. Yeung, "Network Information Flow", IEEE Transactions on Information Theory, vol. 46, no. 4, July 2000, pp. 1204-1216.
2. N. Cai, R. Li and R. Yeung, "Linear Network Coding", IEEE Transactions on Information Theory, vol. 49, no. 2, Feb. 2003, pp. 371-381.
3. R. Koetter and M. Medard, "An Algebraic Approach to Network Coding", IEEE/ACM Transactions on Networking, vol. 11, no. 5, Oct. 2003, pp. 782-795.
4. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain and L. M. G. M. Tolhuizen, "Polynomial time algorithms for multicast network code construction", IEEE Trans. Inf. Theory, vol. 51, no. 6, June 2005, pp. 1973-1982.
5. N. Harvey, "Deterministic network coding by matrix completion", MS Thesis, 2005.
6. A. Lehman and E. Lehman, "Complexity classification of network information flow problems", ACM SODA, 2004, New Orleans, USA, pp. 142-150.
7. J. B. Ebrahimi and C. Fragouli, "Algebraic algorithms for vector network coding", IEEE Trans. Info. Theory, vol. 57, no. 02, Feb. 2011, pp. 996-1007.
8. S. Avestimehr, S. N. Diggavi and D. N. C. Tse, "Wireless network information flow" Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois, September 26-28, 2007, pp. 15-22.
9. R. W. Yeung and N. Cai, "Network error correction, part 1 and part 2", Comm. in Inform. and Systems, vol. 6, 2006, pp. 19-36.
10. Z. Zhang, "Linear network-error Correction Codes in Packet Networks", IEEE Transactions on Information Theory, vol. 54, no. 1, Jan. 2008, pp. 209-218.
11. S. Yang and R. W. Yeung, "Refined Coding Bounds for network error Correction", ITW on Information Theory for Wireless Networks, July 1-6, 2007, Bergen, Norway, pp. 1-5.
12. R. Matsumoto, "Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound", IEICE Trans. Fundamentals, Vol. E90-A, No. 9, September 2007, pp. 1729-1735.
13. K. Prasad and B. Sundar Rajan, "Network-Error Correcting Codes using Small Fields", arXiv:1009.3728[cs. IT], September 2010, Available at http://arxiv.org/abs/1009.3728.
14. N. Cai, R. Li, R. Yeung and Z. Zhang, "Network Coding Theory", Foundations and Trends in Communications and Information Theory, vol. 2, no. 4-5, 2006.
15. A. Borodin and I. Munro, "The computational complexity of algebraic and numeric problems", American Elsevier Pub. Co., 1975.
16. S. Yang and R. W. Yeung, "Construction of Linear Network Codes that achieve a Refined Singleton Bound", ISIT2007, Nice, France, June 24-29, 2007, pp. 1576-1580.