Infoscience

Conference paper

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

Fulltext

Related material