Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

PDF

Professor Jennifer Seberry

Articles 271 - 277 of 277

Full-Text Articles in Physical Sciences and Mathematics

On F-Squares And Their Critical Sets, L. F. Fitina, Jennifer Seberry, D. Sarvate May 2008

On F-Squares And Their Critical Sets, L. F. Fitina, Jennifer Seberry, D. Sarvate

Professor Jennifer Seberry

We define the notion of critical set of an F-square, following the definition of critical set in latin squares, and then give critical sets for certain classes of F-squares. We also generalise certain results obtained for critical sets of latin squares, and look at minimal such sets. We show that critical sets of F-squares need to be studied as well as critical sets for latin squares as the techniques used differ considerably. We obtain theorems for the sizes of critical sets of types F(n; 1,n — 1), F(n;1, 1, n — 2), and F(n; 2, 2, ... , 2).

Go to article

Critical Sets For A Pair Of Mutually Orthogonal Cyclic Latin Squares Of Odd Order Greater Than 9, R. Saharay, Avishek Adhikari, Jennifer Seberry May 2008

Critical Sets For A Pair Of Mutually Orthogonal Cyclic Latin Squares Of Odd Order Greater Than 9, R. Saharay, Avishek Adhikari, Jennifer Seberry

Professor Jennifer Seberry

To date investigations on critical sets for a set of mutually orthogonal latin squares (MOLS) have been carried out only for small orders less than or equal to 9. In this paper we deal with a pair of cyclic orthogonal latin squares of order n, n greater than or equal to 11, n odd. Through construction of a uniquely completable set we give an upper bound on the size of the minimal critical set. In particular for n = 15 a critical set achieving this bound is obtained.

Go to article

Application Of The Discrete Fourier Transform To The Search For Generalised Legendre Pairs And Hadamard Matrices, R. J. Fletcher, M. Gysin, Jennifer Seberry May 2008

Application Of The Discrete Fourier Transform To The Search For Generalised Legendre Pairs And Hadamard Matrices, R. J. Fletcher, M. Gysin, Jennifer Seberry

Professor Jennifer Seberry

We introduce Legendre sequences and generalised Legendre pairs (GL-pairs). We show how to construct a Hadamard matrix of order 2ℓ + 2 from a GL—pair of length ℓ. We review the known constructions for GL-pairs and use the discrete Fourier transform (DFT) and power spectral density (PSD) to enable an exhaustive search for GL-pairs for lengths ℓ ≤ 45 and partial results for other ℓ.

Go to article

Complex Orthogonal Spreading Sequences Using Mutually Orthogonal Complementary Sets, Y. Zhao, Jennifer Seberry, Beata J. Wysocki, Tadeusz A. Wysocki May 2008

Complex Orthogonal Spreading Sequences Using Mutually Orthogonal Complementary Sets, Y. Zhao, Jennifer Seberry, Beata J. Wysocki, Tadeusz A. Wysocki

Professor Jennifer Seberry

This paper presents a new family of complex spreading sequences designed using mutually orthogonal(MO) complementary sets. Based on the technique described in this paper, the correlation properties of sets of sequences are compared to well-known Walsh-Hadamard sequence sets. Further improvement of correlation qualities can be achieved by employing a diagonal modification method. We also present simulation results of an asynchronous multiuser CDMA system using the modified sequences.

Go to article

Design And Implementation Of Personal Firewalls For Handheld Devices, Jianyong Huang, Willy Susilo, Jennifer Seberry May 2008

Design And Implementation Of Personal Firewalls For Handheld Devices, Jianyong Huang, Willy Susilo, Jennifer Seberry

Professor Jennifer Seberry

Personal Digital Assistants (PDAs) have become one of the important tools in our life. Their popularity are due to their small size and mobility which enable them to be carried anywhere. Along with their popularity, handheld devices are starting to become the target for the attackers, who are mainly interested in gaining the data stored in handheld de-vices. Therefore, security of handheld devices have attracted a lot of attention in an effort to protect the sensitive information stored in handheld devices. Securing handheld de-vices is a daunting task. It requires a careful design since the devices have very limited computational …

Go to article

Generalized Bhaskar Rao Designs With Block Size 4 Signed Over Elementary Abelian Groups , G. Ge, M. Greig, Jennifer Seberry May 2008

Generalized Bhaskar Rao Designs With Block Size 4 Signed Over Elementary Abelian Groups , G. Ge, M. Greig, Jennifer Seberry

Professor Jennifer Seberry

de Launey and Seberry have looked at the existence of Generalized Bhaskar Rao designs with block size 4 signed over elementary Abelian groups and shown that the necessary conditions for the existence of a (v, 4, λ; EA(g)) GBRD are sufficient for λ > g with 70 possible exceptions. This article extends that work by reducing those possible exceptions to just a (9,4,18h; EA(9h)) GBRD, where gcd(6, h) = 1, and shows that for λ = g the necessary conditions are sufficient for v > 46.

Go to article

Identification Of Bad Signatures In Batches, J. Pastuszak, D. Michalek, J. Pieprzyk, Jennifer Seberry May 2008

Identification Of Bad Signatures In Batches, J. Pastuszak, D. Michalek, J. Pieprzyk, Jennifer Seberry

Professor Jennifer Seberry

The paper addresses the problem of bad signature identification in batch verification of digital signatures. The number of generic tests necessary to identify all bad signatures in a batch instance, is used to measure the efficiency of verifiers. The divide-and-conquer verifier DCVα(x,n) is defined. The verifier identifies all bad signatures in a batch instance x of the length n by repeatedly splitting the input into α sub-instances. Its properties are investigated. In particular, probability distributions for the number of generic tests necessary to identify one, two and three bad signatures, are derived. The average numbers of GT tests necessary to …

Go to article

First Prev