Network coding over the 232-5 prime field

IEEE International Conference on Communications

Volumn , Issue , 2013, Pages 2922-2927

  Pedersen, Morten Videbaek ^a   Heide, Janus ^a   Vingelmann, Peter ^a,b   Fitzek, Frank H P ^a  

^a AALBORG UNIVERSITY   (Denmark)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK CODING; SIGNAL PROCESSING;

BENCHMARK APPLICATIONS; BINARY DATA; BINARY EXTENSION FIELDS; ERASURE CODING; FINITE FIELDS; PRIME FIELD; RESEARCH TOPICS; THROUGHPUT MEASUREMENTS;

BENCHMARKING;

EID: 84891370745     PISSN: 15503607     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2013.6654986     Document Type: Conference Paper

References (14)

1. R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung, "Network information flow, " IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
2. S. Lin and D. J. Costello, Error Control Coding, Second Edition. Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 2004.
3. K. M. Greenan, E. L. Miller, and T. J. E. Schwarz, "Optimizing galois field arithmetic for diverse processor architectures and applications, " in MASCOTS, E. L. Miller and C. L. Williamson, Eds. IEEE Computer Society, 2008, pp. 257-266.
4. C. Fragouli and E. Soljanin, "Network Coding Fundamentals, " Foundations and Trends in Networking, vol. Vol. 2, Issue 1, pp. 1-133, 2007.
5. J. Heide, M. V. Pedersen, F. Fitzek, and T. Larsen, "Network coding for mobile devices - systematic binary random rateless codes, " in Workshop on Cooperative Mobile Networks 2009 - ICC09. IEEE, Jun. 2009.
6. J. Heide, M. V. Pedersen, F. H. Fitzek, and M. Medard, "On code parameters and coding vector representation for practical rlnc, " in IEEE International Conference on Communications (ICC) - Communication Theory Symposium, Kyoto, Japan, 5-9 June 2011.
7. P. Crowley. (2006, Nov.) Gf(232-5). [Online]. Available: http://www.lshift.net/blog/2006/11/29/gf232-5.
8. D. V. Bailey and C. Paar, "Optimal extension fields for fast arithmetic in public-key algorithms, " in Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology. London, UK: Springer-Verlag, 1998, pp. 472-485. [Online]. Available: http://portal.acm.org/ citation.cfm?id=646763.706317.
9. S. B. Mohan and B. S. Adiga, "Fast algorithms for implementing rsa public key cryptosystem, " Electronics Letters, vol. 21, 1985.
10. D. Hankerson, A. J. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography. Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2003.
11. T. Granlund. (2011, Mar.) Instruction latencies and throughput for amd and intel x86 processors. [Online]. Available: http://gmplib.org/tege/x86- timing.pdf.
12. Steinwurf ApS. (2012) Kodo git repository on github. [Online]. Available: http://github.com/steinwurf/kodo.
13. Steinwurf ApS.. (2012) Fifi git repository on github. [Online]. Available: http://github.com/steinwurf/fifi.
14. R. E. Bryant and D. R. O'Hallaron, Computer Systems: A Programmer's Perspective, 2nd ed. USA: Addison-Wesley Publishing Company, 2010.