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
Genetically-designed arbitrary length almost difference sets
Oliveri, Giacomo;Donelli, Massimo;Massa, Andrea
2009-01-01
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 approachFile in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
R184.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
163.53 kB
Formato
Adobe PDF
|
163.53 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
