On perfect binary arrays

On perfect binary arrays

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

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

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
Your details
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 perfect binary arrays introduced by Calabro and Wolf correspond to a class of difference sets, viz. H sets. Existence and construction of H sets on various grids are considered. In particular, H sets on 12 × 12 grids are presented and a number of two-dimensional grids are indicated where H sets do not exist.


    1. 1)
      • On the synthesis of two-dimensional arrays with desirable properties
    2. 2)
      • Perfect binary arrays with 36 elements
    3. 3)
      • Differencesets
    4. 4)
      • On the construction of the aperture synthesis systems using difference sets
    5. 5)
      • Aperiodic thinned antenna arrays with optimal location of elements based on difference sets
    6. 6)
      • On signals with the minimal ambiguity function for simultaneous determination of the range and velocity of objects
    7. 7)
      • On difference sets whose parameters satisfy a certain relation
    8. 8)
      • Character sums and difference sets
    9. 9)
      • A family of difference sets
    10. 10)
      • A summary of noncyclic difference sets, K > 20
    11. 11)
      • , Algebraic coding theory
    12. 12)
      • On Hadamard difference sets, A survey of combinatorial theory

Related content

This is a required field
Please enter a valid email address