Design of efficient erasure codes with differential evolution

The design of practical and powerful codes for protection against erasures can be reduced to optimizing solutions of a highly nonlinear constraint satisfaction problem. In this paper we will attack this problem using the differential evolution approach and significantly improve results previously obtained using classical optimization procedures


Published in:
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2000, 5
Year:
2000
Keywords:
Laboratories:




 Record created 2007-01-16, last modified 2018-01-27


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)