A Fourier-analytic Approach to Counting Partial Hadamard Matrices

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

\keywords{partial Hadamard matrices, random walks} Submitted to Cryptography and Communications: Discrete Structures, Boolean

Scientific paper

In this paper, we study a family of lattice walks which are related to the Hadamard conjecture. There is a bijection between paths of these walks which originate and terminate at the origin and equivalence classes of partial Hadamard matrices. Therefore, the existence of partial Hadamard matrices can be proved by showing that there is positive probability of a random walk returning to the origin after a specified number of steps. Moreover, the number of these designs can be approximated by estimating the return probabilities. We use the inversion formula for the Fourier transform of the random walk to provide such estimates. We also include here an upper bound, derived by elementary methods, on the number of partial Hadamard.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Fourier-analytic Approach to Counting Partial Hadamard Matrices 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 A Fourier-analytic Approach to Counting Partial Hadamard Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fourier-analytic Approach to Counting Partial Hadamard Matrices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-316658

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.