Loading...
conference paper
Design of efficient erasure codes with differential evolution
2000
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2000
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
Type
conference paper
Authors
Publication date
2000
Published in
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2000
Start page
5
Subjects
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
January 16, 2007
Use this identifier to reference this record