%0 Generic
%A Oliveri, Giacomo
%A Donelli, Massimo
%A Massa, Andrea
%D 2011
%F elediasc12:379
%K ADS design , almost difference sets , antenna array thinning , binary genetic algorithm , coding theory , combinatorial optimisation problem , cryptography , genetically-designed arbitrary length almost difference sets
%T Genetically-designed arbitrary length almost difference sets
%U http://www.eledia.org/students-reports/379/
%X Almost difference sets (ADSs) have important applications in cryptography, coding theory, and antenna array thinning. A new approach is proposed to derive ADSs of arbitrary lengths. Such a technique recasts the ADS design as a combinatorial optimisation problem successively solved by means of a suitable binary genetic algorithm. New ADSs are derived to assess the effectiveness of the proposed approach. "This paper is a postprint of a paper submitted to and accepted for publication in Electronics Letters and is subject to Institution of Engineering and Technology Copyright. The copy of record is available at IET Digital Library".