Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Genetically-designed arbitrary length almost difference sets

Genetically-designed arbitrary length almost difference sets

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

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.

Inspec keywords: genetic algorithms; binary sequences; set theory; cryptography; combinatorial mathematics; encoding; antenna arrays

Other keywords: cryptography; ADS design; genetically-designed arbitrary length almost difference sets; binary genetic algorithm; coding theory; almost difference sets; antenna array thinning; combinatorial optimisation problem

Subjects: Antenna arrays; Combinatorial mathematics; Cryptography; Codes; Optimisation techniques

References

    1. 1)
      • C. Ding , T. Feng . A generic construction of complex codebooks meeting the welch bound. IEEE Trans. Inf. Theory , 11 , 4245 - 4250
    2. 2)
      • C. Ding , T. Helleseth , H. Martinsen . New families of binary sequences with optimal three-level autocorrelation. IEEE Trans. Inf. Theory , 1 , 428 - 433
    3. 3)
      • C. Ding , T. Feng . Codebooks from almost difference sets. Des. Codes Cryptogra. , 1 , 113 - 126
    4. 4)
      • K.T. Arasu , C. Ding , T. Helleseth , P.V. Kumar , H.M. Martinsen . Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inf. Theory , 7 , 2934 - 2943
    5. 5)
      • R. Haupt , D.H. Werner . (2007) Genetic algorithms in electromagnetics.
    6. 6)
    7. 7)
      • C. Ding , T. Helleseth , K.Y. Lam . Several classes of binary sequences with three-level autocorrelation. IEEE Trans. Inf. Theory , 7 , 2606 - 2612
    8. 8)
      • C. Ding . Complex codebooks from combinatorial designs. IEEE Trans. Inf. Theory , 9 , 4229 - 4235
    9. 9)
      • Y. Zhang , J.G. Lei , S.P. Zhang . A new family of almost difference sets and some necessary conditions. IEEE Trans. Inf. Theory , 5 , 2052 - 2061
    10. 10)
      • Eledia: Almost Difference Set Repository (http://www.eledia.ing.unitn.it).
    11. 11)
    12. 12)
      • G. Oliveri , M. Donelli , A. Massa . Linear array thinning exploiting almost difference sets. IEEE Trans. Antennas Propag.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2009.1927
Loading

Related content

content/journals/10.1049/el.2009.1927
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address