Design of Efficient Erasure Codes with Differential Evolution
01 January 2000
The design of practical and powerful codes for protection against erasures in digital communication can be reduced to optimizing solutions of a highly nonlinear constraint satisfaction problem [LMS+97]. In this paper, we will attack this problem using the Differential Evolution approach [PS97] and significantly improve results previously obtained using classical optimization procedures.