The merit factor of binary arrays derived from the quadratic character

Details The merit factor of binary arrays derived from the quadratic character The merit factor of binary arrays derived from the quadratic character

2011-05-26

arxiv.org/abs/1105.5176v2

Adv. Math. Commun., vol. 5, no. 4, pp. 589-607, Nov. 2011

Computer Science

Information Theory

minor corrections

Scientific paper

We calculate the asymptotic merit factor, under all cyclic rotations of rows and columns, of two families of binary two-dimensional arrays derived from the quadratic character. The arrays in these families have size p x q, where p and q are not necessarily distinct odd primes, and can be considered as two-dimensional generalisations of a Legendre sequence. The asymptotic values of the merit factor of the two families are generally different, although the maximum asymptotic merit factor, taken over all cyclic rotations of rows and columns, equals 36/13 for both families. These are the first non-trivial theoretical results for the asymptotic merit factor of families of truly two-dimensional binary arrays.

Affiliated with

Also associated with

No associations

Rating

The merit factor of binary arrays derived from the quadratic character does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The merit factor of binary arrays derived from the quadratic character, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The merit factor of binary arrays derived from the quadratic character will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216966