eprintid: 379
rev_number: 6
eprint_status: archive
userid: 5
dir: disk0/00/00/03/79
datestamp: 2011-04-22
lastmod: 2013-07-03 13:53:49
status_changed: 2013-07-03 13:53:49
type: techreport
metadata_visibility: show
item_issues_count: 0
creators_name: Oliveri, Giacomo
creators_name: Donelli, Massimo
creators_name: Massa, Andrea
title: Genetically-designed arbitrary length almost difference sets
ispublished: unpub
subjects: TU
full_text_status: public
keywords: ADS design , almost difference sets , antenna array thinning , binary genetic algorithm , coding theory , combinatorial optimisation problem , cryptography , genetically-designed arbitrary length almost difference sets
abstract: 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".
date: 2011-01
date_type: published
institution: University of Trento
department: informaticat
refereed: FALSE
referencetext: 1 Carlet, C., and Ding, C.: ‘Highly nonlinear mappings’, J. Complexity,
2004, 20, (2), pp. 205 –244
2 Ding, C., and Feng, T.: ‘Codebooks from almost difference sets’, Des.
Codes Cryptogra., 2008, 46, (1), pp. 113–126
3 Ding, C.: ‘Complex codebooks from combinatorial designs’, IEEE
Trans. Inf. Theory, 2006, 52, (9), pp. 4229– 4235
4 Ding, C., and Feng, T.: ‘A generic construction of complex codebooks
meeting the welch bound’, IEEE Trans. Inf. Theory, 2007, 53, (11),
pp. 4245–4250
5 Oliveri, G., Donelli, M., and Massa, A.: ‘Linear array thinning
exploiting almost difference sets’, IEEE Trans. Antennas Propag.,
accepted for publication
6 Ding, C., Helleseth, T., and Lam, K.Y.: ‘Several classes of binary
sequences with three-level autocorrelation’, IEEE Trans. Inf. Theory,
1999, 45, (7), pp. 2606–2612
7 Ding, C., Helleseth, T., and Martinsen, H.: ‘New families of binary
sequences with optimal three-level autocorrelation’, IEEE Trans. Inf.
Theory, 2001, 47, (1), pp. 428– 433
8 Arasu, K.T., Ding, C., Helleseth, T., Kumar, P.V., and Martinsen, H.M.:
‘Almost difference sets and their sequences with optimal
autocorrelation’,IEEE Trans. Inf. Theory, 2001, 47, (7), pp. 2934–2943
9 Zhang, Y., Lei, J.G., and Zhang, S.P.: ‘A new family of almost
difference sets and some necessary conditions’, IEEE Trans. Inf.
Theory, 2006, 52, (5), pp. 2052–2061
10 Eledia: Almost Difference Set Repository (http://www.eledia.ing.unitn.
it)
11 Haupt, R., and Werner, D.H.: ‘Genetic algorithms in electromagnetics’
(Wiley, Hoboken, NJ, USA, 2007)
12 Caorsi, S., Lommi, A., Massa, A., and Pastorino, M.: ‘Peak sidelobe
level reduction with a hybrid approach based on GAs and difference
sets’, IEEE Trans. Antennas Propag., 2004, 52, (4), pp. 1116–1121
citation:   Oliveri, Giacomo and Donelli, Massimo and Massa, Andrea  (2011) Genetically-designed arbitrary length almost difference sets.  [Technical Report]    (Unpublished)  
document_url: http://www.eledia.org/students-reports/379/1/DISI-11-078-R184.pdf