DocumentCode
2384001
Title
Design of efficient erasure codes with differential evolution
Author
Shokrollahi, Amin ; Storn, Rainer
Author_Institution
Lucent Technol. Bell Labs., Murray Hill, NJ, USA
fYear
2000
fDate
2000
Firstpage
5
Abstract
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
Keywords
codes; constraint theory; graph theory; optimisation; differential evolution; efficient erasure codes; highly nonlinear constraint satisfaction problem; sparse bipartite graphs; Bipartite graph; Constraint theory; Decoding; Design optimization; Genetic mutations; Polynomials; Protection; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866295
Filename
866295
Link To Document