No subject area
Husain's SBIBD, University of Wollongong (2012)
Husain's SBIBD(16,6,2) (16,6,2) SBIBD(4k^2,2k^2+k,k^2+k) and regular symmetric Hadamard matrices of order 4k^2 and maximal excess...
Weighing matrices and sequences, University of Wollongong (2012)
Hadamard mathematical matrices for weighing.
Hadamard matrices, University of Wollongong (2012)
Dataset shows discoveries made by the author relating to Hadamard matrices.
A new generic digital signature algorithm (with Vinhbuu To and Dongvu Tonien), Faculty of Informatics - Papers (2011)
In this paper, we study two digital signature algorithms, the DSA and ECDSA, which have...
The amicable-Kronecker construction of quaternion orthogonal designs (with Sarah Spence Adams), Faculty of Informatics - Papers (2011)
Recently, quaternion orthogonal designs (QODs) were introduced as a mathematical construct with the potential for...
Differential fault analysis of LEX (with Jianyong Huang and Willy Susilo), Faculty of Informatics - Papers (2010)
LEX is a stream cipher based on the round transformation of the AES block cipher,...
Inter-domain routing validator based spoofing defence system (with Lei Wang and Tianbing Xia), Faculty of Informatics - Papers (2010)
IP spoofing remains a problem today in the Internet. In this paper, a new system...
On circulant and two-circulant weighing matrices (with K T. Arasu, Ilias S. Kotsireas, and Christos Koukouvinos), Faculty of Informatics - Papers (2010)
We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants....
Some remarks on Hadamard matrices (with Marilena Mitrouli), Faculty of Informatics - Papers (2010)
In this note we use combinatorial methods to show that the unique, up to equivalence,...
Novel constructions of improved square complex orthogonal designs for eight transmit antennas (with Le Chung Tran, Alfred Mertins, Tadeusz A. Wysocki, and Sarah S. Adams), Faculty of Informatics - Papers (2009)
Constructions of square, maximum rate complex orthogonal space–time block codes (CO STBCs) are well known,...
The Theory of Quaternion Orthogonal Designs (with K. Finlayson, S. Spense Adams, T. A. Wysocki, T. Xia, and B. J. Wysocki), Faculty of Informatics - Papers (2008)
Over the past several years, there has been a renewed interest in complex orthogonal designs...
On the pivot structure for the weighing matrix W(12,11) (with C. Kravvaritis and M. Mitrouli), Faculty of Informatics - Papers (2007)
C. Koukouvinos, M. Mitrouli and Jennifer Seberry, in "Growth in Gaussian elimination for weighing matrices,...
Some new results of regular Hadamard matrices and SBIBD II (with T. Xia and M. Xia), Faculty of Informatics - Papers (2007)
In this paper we prove that there exist 4—{k2; ½k(k–1); k(k–2)} SDS, regular Hadamard matrices...
A Simple Orthogonal Space-Time-Polarization Block Code (with B. J. Wysocki, Tadeusz Wysocki, S. Spence Adams, and H. Sharif), Computer & Electronics Engineering Faculty Publications (2007)
This letter proposes a simple but highly efficient technique to jointly utilize space, time, and...
Generalized Bhaskar Rao Designs with Block Size 3 over Finite Abelian Groups (with G. Ge, M. Grieg, and R. Seberry), Faculty of Informatics - Papers (2007)
We show that if G is a finite Abelian group and the block size is...
Temporal Authorizations Scheme for XML Documents (with J. Wu and Y. Mu), Faculty of Informatics - Papers (2007)
In a large system, XML documents associated with it can be large and complicated. To...
The power and influence in some Youden squares and secret sharing (with L. Fitina and K. G. Russell), Faculty of Informatics - Papers (2007)
We investigate subsets of critical sets of some Youden squares in the context of secret...
On the Internal Structure of ALPHA-MAC (with J. Huang and W. Susilo), Faculty of Informatics - Papers (2006)
ALPHA-MAC is a MAC function which uses the building blocks of AES. This paper studies...
A Minimal Critical Set of a Class of Youden Squares (with L. Fitina and K. G. Russell), Faculty of Informatics - Papers (2006)
We consider the Youden square formed by deleting one row of a v x v...
Hadamard ideals and Hadamard matrices with circulant core (with I. S. Kotsireas and C. Koukouvinos), Faculty of Informatics - Papers (2006)
Computational Algebra methods have been used successfully in various problems in many fields of Mathematics....
Hadamard ideals and Hadamard matrices with two circulant cores (with I. S. Kotsireas and C. Koukouvinos), Faculty of Informatics - Papers (2006)
We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores,...
Combinatorial structures for Design of Wireless Sensor Networks (with D. Chakrabarti), Faculty of Informatics - Papers (2006)
Combinatorial designs are very effective tools for managing keys in an infrastructure where power and...
ICT professionals’ perceptions of responsibility for breaches of computer security (with M. Barrett and K. Garrety), Faculty of Informatics - Papers (2006)
With ubiquitous computer use and networking, concerns about security breaches have intensified. However the human...
Amicable Orthogonal Designs of Order 8 for Complex Space-Time Block Codes (with Y. Zhao, T. Xia, Y. Wang, B. J. Wysocki, T. A. Wysocki, and L. C. Tran), Faculty of Informatics - Papers (2006)
New amicable orthogonal designs AODs(8; 1; 1; 1; 2; 2; 2), AODs(8; 1; 1; 4;...
Complex Orthogonal Spreading Sequences Using Mutually Orthogonal Complementary Sets (with Y. Zhao, B. J. Wysocki, and T. A. Wysocki), Faculty of Informatics - Papers (2006)
This paper presents a new family of complex spreading sequences designed using mutually orthogonal(MO) complementary...
Inequivalence of Nega-cyclic +-1 Matrices (with Russell Ang and Tadeusz Wysocki), Journal of Combinatorial Mathematics and Combinatorial Computing (2006)
We study nega-cyc1ic ±1 matrices. We obtain preliminary results which are then used to decrease...
Inequivalence of Nega-cyclic ±1 Matrices (with R. Ang and T. A. Wysocki), Faculty of Informatics - Papers (2006)
We study nega-cyclic ±1 matrices. We obtain preliminary results which are then used to decrease...
Modeling Dual Polarization Wireless Fading Channels using Quaternions (with B. J. Wysocki and Tadeusz Wysocki), Computer & Electronics Engineering Faculty Publications (2006)
In the letter we describe signal transmitted between two dual-polarized antennas using a quaternion notation....
New Constructing of regular Hadamard matrices (with T. Xia and M. Xia), Faculty of Informatics - Papers (2006)
For every prime power q ≡ 7 mod 16, we obtain the (q; a, b,...
On Amicable Orthogonal Designs of Order 8 (with Y. Zhao and Y. Wang), Faculty of Informatics - Papers (2006)
Some new amicable orthogonal designs of order 8 are found as part of a complete...
On the internal structure of ALPHA-MAC (with Jianyong Huang and Willy Susilo), in P. Nguyen (ed.), First International Conference on Cryptology in Vietnam 2006 (Vietcrypt 2006) Lecture Notes in Computer Science, (2006)
ALPHA-MAC is a MAC function which uses the building blocks of AES. This paper studies...
Access Policy Sheet for Access Control in Fine-Grained XML (with J. Wu, Y. Mu, and C. Ruan), Faculty of Informatics - Papers (2005)
We propose an access control scheme for developing authorization rules for XML documents, allowing flexible...
A Cryptographic Solution for General Access Control (with Y. Kong, J. R. Getta, and P. Yu), Faculty of Informatics - Papers (2005)
As one of the most popular information safeguarding mechanisms, access control is widely deployed in...
Generalized Williamson and Wallis-Whiteman Constructions for Improved Square Order-8 CO STBCs (with L. C. Tran, T. A. Wysocki, A. Mertins, and S. A. Spence), Faculty of Informatics - Papers (2005)
Constructions of square, maximum rate Complex Orthogonal Space-Time Block Codes (CO STBCs) are well known,...
Delegatable Access Control for Fine-Grained XML (with J. Wu, Y. Mu, and C. Ruan), Faculty of Informatics - Papers (2005)
The access control mechanisms are critical to ensure security in XML (eXtensible Markup Language). Several...
Orthogonal Designs with Quaternion Elements (with K. Finlayson, T. A. Wysocki, and T. Xia), Faculty of Informatics - Papers (2005)
We introduce orthogonal designs with quaternion elements and show their existence. In future work we...
On the growth problem for skew and symmetric conference matrices (with C. Kravvaritis and M. Mitrouli), Faculty of Informatics - Papers (2005)
C. Koukouvinos, M. Mitrouli and Jennifer Seberry, in "Growth in Gaussian elimination for weighing matrices,...
A generalized algorithm for the generation of correlated Rayleigh fading envelopes (with L. C. Tran, T. A. Wysocki, and A. Mertins), Faculty of Informatics - Papers (2005)
Although the generation of correlated Rayleigh fading envelopes has been intensively considered in the literature,...
A Construction Technique for Generalized Complex Orthogonal Designs and Applications to Wireless Communications (with S. A. Spence and T. A. Wysocki), Faculty of Informatics - Papers (2005)
We introduce a construction technique for generalized complex linear processing orthogonal designs, which are p...
An exposure property of block designs (with Y. Wang, B. J. Wysocki, T. A. Wysocki, L. C. Tran, Y. Zhao, and T. Xia), Faculty of Informatics - Papers (2005)
An exposure property of block designs is defined and investigated in this paper. The families...
An infinite family of Goethals-Seidel arrays (with M. Xia and T. Xia), Faculty of Informatics - Papers (2005)
In this paper we construct an infinite family of Goethals-Seidel arrays and prove the theorem:...
Critical sets for a pair of mutually orthogonal cyclic latin squares of odd order greater than 9 (with R. SahaRay and A. Adhikari), Faculty of Informatics - Papers (2005)
To date investigations on critical sets for a set of mutually orthogonal latin squares (MOLS)...
Critical sets in orthogonal arrays with 7 and 9 levels (with R. SahaRay and A. Adhikari), Faculty of Informatics - Papers (2005)
To date very few results are known on the critical sets for a set of...
On Orthogonal Designs in Order 48 (with W. H. Holzmann, H Kharaghani, and B. Tayfeh-Rezaie), Faculty of Informatics - Papers (2005)
We show that all 3164 possible OD(48; s1, s2,s3) exist. In addition to the use...
Py (Roo): A Fast and Secure Stream Cipher (with E. Biham), Faculty of Informatics - Papers (2005)
Py (pronounced Roo, a shorthand for Kangaroo) is a new stream cipher designed especially for...
A Generalized Algorithm for the Generation of Correlated Rayleigh Fading Envelopes in Radio Channels (with L. C. Tran, T. A. Wysocki, and A. Mertins), Faculty of Informatics - Papers (2005)
Although generation of correlated Rayleigh fading envelopes has been intensively considered in the literature, all...
Values of Minors of Some Infinite Families of Matrices Constructed from Supplementary Difference Sets and Their Application to the Growth Problem (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2005)
We obtain explicit formulae for the values of the 2v - j minors, j =...
A new method for constructing T-matrices (with M. Xia, T. Xia, and G. Zuo), Faculty of Informatics - Papers (2005)
For every prime power q = 3 (mod 8) we prove the existence of (q;...
A new method for constructing Williamson matrices (with Xia Mingyuan and Tianbing Xia), Design, Codes and Cryptography (2005)
For every prime power q ≡1 (mod 4) we prove the existence of (q; x,...
On some applications of Hadamard matrices (with B. J. Wysocki and T. A. Wysocki), Faculty of Informatics - Papers (2005)
Modern communications systems are heavily reliant on statistical techniques to recover information in the presence...
Observations on the Message Integrity Code in IEEE802.11Wireless LANs (with J. Huang and W. Susilo), Faculty of Informatics - Papers (2004)
This paper surveys the security of the message integrity code used in the IEEE802.11 Wireless...
Two new complex orthogonal space time codes for 8 transmit antennas (with L. C. Tran, Y. Wang, B. J. Wysocki, T. A. Wysocki, T. Xia, and Y. Zhao), Faculty of Informatics - Papers (2004)
Two new constructions of complex orthogonal space-time block codes of order 8 based on the...
Further Results on Strongbox Secured Secret Sharing Schemes (with G. Gamble, B. M. Maenhaut, and A. Penfold Street), Faculty of Informatics - Papers (2004)
We extend our earlier work on ways in which defining sets of combinatorial designs can...
Homogeneous bent functions of degree n in 2n variables do not exist for n > 3 (with T. Xia, J. Pieprzyk, and C. Charnes), Faculty of Informatics - Papers (2004)
We prove that homogeneous bent functions f : GF(2)2n —> GF(2) of degree n do...
Orthogonal Designs from Negacyclic Matrices (with K. Finlayson), Faculty of Informatics - Papers (2004)
We study the use of negacyclic matrices to form orthogonal designs and hence Hadamard matrices....
Orthogonal Designs of Kharaghani Type: II (with C. Koukouvinos), Faculty of Informatics - Papers (2004)
H. Kharaghani, in "Arrays for orthogonal designs", J. Combin. Designs, 8 (2000), 166-173, showed how...
Complex orthogonal sequences from amicable Hadamard matrices (with L. C. Tran, B. J. Wysocki, T. A. Wysocki, T. Xia, and Y. Zhao), Faculty of Informatics - Papers (2004)
The paper deals with the novel technique of designing complex spreading sequences with only four...
Generalized orthogonal designs (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2004)
Orthogonal designs and their special cases such as weighing matrices and Hadamard matrices have many...
Complex Orthogonal Sequences from Amicable Hadamard Matrices (with L. C. Tran, B. J. Wysocki, Tadeusz Wysocki, T. Xia, and Ying Zhao), Computer & Electronics Engineering Faculty Publications (2004)
The paper deals with the novel technique of designing complex spreading sequences with only four...
Two complex orthogonal space-time codes for eight transmit antennas (with L. C. Tran, Y. Wang, B. J. Wysocki, T. A. Wysocki, T. Xia, and Y. Zhao), Faculty of Informatics - Papers (2004)
Two new constructions of complex orthogonal space-time block codes of order 8 based on the...
Combinatorial Constructions of 3- and 4-Secure Codes (with Y. Wang, B. J. Wysocki, T. A. Wysocki, W. Susilo, T. Xia, Y. Zhao, and L. C. Tran), Faculty of Informatics - Papers (2003)
In this paper, 3- and 4-secure codes are constructed from combinatorial designs. Both constant weight...
Forensic Computing (with X. Li), Faculty of Informatics - Papers (2003)
Technology is rapidly changing the speed and manner in which people interact with each other...
Design and Implementation of Personal Firewalls for Handheld Devices (with J. Huang and W. Susilo), Faculty of Informatics - Papers (2003)
Personal Digital Assistants (PDAs) have become one of the important tools in our life. Their...
Secure Computations on Handheld Devices with the Help of an Untrusted Server (with J. Huang and W. Susilo), Faculty of Informatics - Papers (2003)
Recently, handheld devices have become one of the most popular computing tools. Although handheld devices...
Generalized Bhaskar Rao Designs with Block Size 4 Signed over Elementary Abelian Groups (with G. Ge and M. Greig), Faculty of Informatics - Papers (2003)
de Launey and Seberry have looked at the existence of Generalized Bhaskar Rao designs with...
Some results on self-orthogonal and self-dual codes (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2003)
We use generator matrices G satisfying GGT = aI+bJ over Zk to obtain linear self-orthogonal...
The Maximal Determinant and Subdeterminants of ±1 Matrices (with T. Xia, C. Koukouvinos, and M. Mitrouli), Faculty of Informatics - Papers (2003)
In this paper we study the maximal absolute values of determinants and subdeterminants of ±1...
Construction of highly non-linear cubic homogeneous Boolean functions on GF2n+l (2) (with J. Wu and T. Xia), Faculty of Informatics - Papers (2003)
The work studies highly nonlinear Boolean functions in GF2n+1(2), i.e. for the dimensions where bent...
On Using Fast Exponentiation Algorithm in PDAs (or: How Secure is the Discrete Logarithm Problem Assumption in PDAs?) (with W. Susilo and J. Huang), Faculty of Informatics - Papers (2003)
Personal Digital Assistants (PDAs) are the miniature of normal size PCs, with a very limited...
An Algorithm to find Formulae and Values of Minors for Hadamard matrices: II (with C. Koukouvinos, E. Lappas, and M. Mitrouli), Faculty of Informatics - Papers (2003)
An algorithm computing the (n — j) x (n — j ) , j =...
Further Observations on the Structure of the AES Algorithm (with B. Song), Faculty of Informatics - Papers (2003)
Abstract. We present our further observations on the structure of the AES algorithm relating to...
On Full Orthogonal Designs in Order 72 (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2003)
We find new full orthogonal designs in order 72 and show that of 2700 possible...
Orthogonal Designs of Kharaghani Type: I (with C. Koukouvinos), Faculty of Informatics - Papers (2003)
We use an array given in H. Kharaghani, Arrays for orthogonal designs, J. Combin. Designs,...
Regular Hadamard Matrices, Maximum Excess and SBIBD (with T. Xia and M. Xia), Faculty of Informatics - Papers (2003)
When k = q1, q2, q1q2, q1q4, q2q3N, q3q4N, q1, q2 and q3 are prime...
Some results on Kharaghani type orthogonal designs (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2003)
In this paper we give a general theorem which can be used to multiply the...
Weighing Matrices and Self-Orthogonal Quaternary Codes (with C. Charnes), Faculty of Informatics - Papers (2003)
We consider families of linear self-orthogonal and self-dual codes over the ring Z4 which are...
Application of nega-cyclic matrices to generate spreading sequences (with R. Ang, B. J. Wysocki, and T. A. Wysocki), Faculty of Informatics - Papers (2003)
In the paper, we present a new class of orthogonal bipolar spreading sequences designed based...
Williamson-Hadamard Spreading Sequences for DS-CDMA Applications (with Beata J. Wysocki and Tadeusz A. Wysocki), Faculty of Informatics - Papers (2003)
Orthogonal bipolar spreading sequences are used in direct sequence code division multiple acces (DS-CDMA) systems...
On Full Orthogonal Designs in Order 56 (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2002)
We find new full orthogonal designs in order 56 and show that of 1285 possible...
Necessary and Sufficient Conditions for Three and Four Variable Orthogonal Designs in Order 36 (with S. Georgiou, C. Koukouvinos, and M. Mitrouli), Faculty of Informatics - Papers (2002)
We use a new algorithm to find new sets of sequences with entries from {0,...
On the (v,5,λ)-Family of Bhaskar Rao Designs (with G. R. Chaudhry and M. Greig), Faculty of Informatics - Papers (2002)
We establish that the necessary conditions for the existence of Bhaskar Rao designs of block...
On A Use Of Golay Sequences For Asynchronous DS CDMA Applications (with B. J. Wysocki and T. A. Wysocki), Faculty of Informatics - Papers (2002)
Golay complementary sequences, often referred to as Golay pairs, are characterised by the property that...
A Search for Hadamard Matrices constructed from Williamson Matrices (with J. Horton and C. Koukouvinos), Faculty of Informatics - Papers (2002)
We describe the implementation of a distributed computer search that uses Williamson's construction for Hadamard...
Golay Sequences for DS CDMA Applications (with B. J. Wysocki and T. A. Wysocki), Faculty of Informatics - Papers (2002)
Golay complementary sequences, often referred to as Golay pairs, are characterised by the property that...
An infinite family of Hadamard matrices with fourth last pivot n/2 (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2002)
We show that the equivalence class of Sylvester Hadamard matrices give an infinite family of...
Hadamard matrices, orthogonal designs and construction algorithms (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2002)
We discuss algorithms for the construction of Hadamard matrices. We include discussion of construction using...
Short Amicable Sets (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2002)
Abstract: A pair of matrices X and Y are said to be amicable if XYT...
The Analysis of Zheng-Seberry Scheme (with D. Soldera and C. Qu), Faculty of Informatics - Papers (2002)
The Zheng-Seberry (ZS) encryption scheme was published in 1993 and was one of the first...
A New Cryptanalytic Method Using the Distribution Characteristics of Substitution Distances (with B. Song and H. Wang), Faculty of Informatics - Papers (2001)
In this paper, we suggest a new method for cryptanalysis of the basic structures of...
On circulant best matrices and their applications (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2001)
Call four type 1 (1, -1) matrices, X1, X2, X3, X4, of the same group...
Application of the Discrete Fourier Transform to the Search for Generalised Legendre Pairs and Hadamard Matrices (with R. J. Fletcher and M. Gysin), Faculty of Informatics - Papers (2001)
We introduce Legendre sequences and generalised Legendre pairs (GL-pairs). We show how to construct a...
New D-optimal Designs of Order 110 (with R. J. Fletcher), Faculty of Informatics - Papers (2001)
We give two new D-optimal designs of order 110.
On Infinite Families of Sequences with One and Two Valued Autocorrelation and Two Valued Crosscorrelation Function (with M. Gysin), Faculty of Informatics - Papers (2001)
We show how to construct infinite families of sequences that have one and two valued...
On Ternary Complementary Pairs (with M. Gysin), Faculty of Informatics - Papers (2001)
Let A = {a0, ... aℓ-1 }, B = {b0, . . . , bℓ-1...
Equitability in Retroactive Key Confiscation versus Proactive Key Escrow (with Y. Desmedt and M. Burmester), Faculty of Informatics - Papers (2001)
The British Regulations of Investigatory Powers (RIP) Act 2000 is one of the first modern...
An Algorithm to find Formulae and Values of Minors for Hadamard Matrices (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2001)
We give an algorithm to obtain formulae and values for minors of Hadamard matrices. One...
A new algorithm for computer searches for orthogonal designs (with S. Georgiou, C. Koukouvinos, and M. Mitrouli), Faculty of Informatics - Papers (2001)
We present a new algorithm for computer searches for orthogonal designs. Then we use this...
Infinite families of orthogonal designs : I (with Christos Koukouvinos), Faculty of Informatics - Papers (2001)
We generalise a method inspired by Kharaghani and Holzmann to obtain infinite families of 6-variables...
On the complete pivoting conjecture for Hadamard matrices of small orders (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2001)
In this paper we study explicitly the pivot structure of Hadamard matrices of small orders...
Short amicable sets and Kharaghani type orthogonal designs (with C. Koukouvinos), Faculty of Informatics - Papers (2001)
Short amicable sets were introduced recently and have many applications. The construction of short amicable...
Values of Minors of (1, 1) Incidence Matrices of SBIBDs and Their Application to the Growth Problem (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2001)
We obtain explicit formulae for the values of the v j minors, j = 0,...
Values of minors of (1,-1) incidence matrices of SBIBDs and their application to the growth problem (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2001)
We obtain explicit formulae for the values of the v - j minors, j =...
Values of Minors of an Infinite Family of D-Optimal Designs and Their Application to the Growth Problem (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2001)
We obtain explicit formulae for the values of the 2v — j minors, j =...
On amicable sequences and orthogonal designs (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2000)
In this paper we give a general theorem which can be used to multiply the...
Codes Identifying Bad Signatures in Batches (with J. Pastuszak and J. Pieprzyk), Faculty of Informatics - Papers (2000)
The work is concerned with identification of bad signatures in a sequence which is validated...
Construction of cubic homogeneous boolean bent functions (with T. Xia and J. Pieprzyk), Faculty of Informatics - Papers (2000)
We prove that cubic homogeneous bent functions f : V2n → GF(2) exist for all...
On the spectrum of an F-square (with L. Fitina), Faculty of Informatics - Papers (2000)
Given an F-square of some type F(n; αo, αl, ..., αv-1) what critical set sizes...
A New and Efficient Fail—Stop Signature Scheme (with W. Susilo, R. Safavi-Naini, and M. Gysin), Faculty of Informatics - Papers (2000)
Security of ordinary digital signature schemes relies on a computational assumption. Fail-stop signature schemes provide...
Bounds on the Maximum Determinant for (1, –1) Matrices (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2000)
We suppose the Hadamard conjecture is true and an Hadamard matrix of order 4t, exists...
An almost optimal fail-stop signature scheme (with W. Susilo, R. Safavi-Naini, and M. Gysin), Faculty of Informatics - Papers (2000)
Security of ordinary digital signature schemes relies on a computational assumption. Fail-stop signature schemes provide...
Bounds on the maximum determinant for (1,-1) matrices (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2000)
We suppose the Hadamard conjecture is true and an Hadamard matrix of order 4t, exists...
Growth in Gaussian elimination for weighing matrices W(n,n-1) (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2000)
We consider the values for large minors of a skew-Hadamard matrix or conference matrix W...
Growth in Gaussian Elimination for Weighing Matrices, W (n, n — 1) (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2000)
We consider the values for large minors of a skew-Hadamard matrix or conference matrix W...
Homogeneous Bent Functions (with C. Qu and J. Pieprzyk), Faculty of Informatics - Papers (2000)
This paper discusses homogeneous bent functions. The space of homogeneous functions of degree three in...
Identification of Bad Signatures in Batches (with J. Pastuszak, D. Michalek, and J. Pieprzyk), Faculty of Informatics - Papers (2000)
The paper addresses the problem of bad signature identification in batch verification of digital signatures....
Influence of entries in critical sets of Room squares (with Ghulam Chaudhry), Faculty of Informatics - Papers (2000)
We consider structures which have rules for completion such as balanced incomplete block designs, Latin...
Necessary and sufficient conditions for two variable orthogonal designs in order 44: Addendum (with S. Georgiou, C. Koukouvinos, and M. Mitrouli), Faculty of Informatics - Papers (2000)
In our recent paper Necessary and sufficient conditions for some two variable orthogonal designs in...
New orthogonal designs and sequences with two and three variables in order 28 (with C. Koukouvinos), Faculty of Informatics - Papers (2000)
We give new sets of sequences with entries from {0, ±a, ±b, ±c} on the...
Relationships between boolean functions and symmetric groups (with Chengxin Qu and Josef Pieprzyk), Faculty of Informatics - Papers (2000)
We study the relations between boolean functions and symmetric groups. We consider elements of a...
Strongbox Secured Secret Sharing Schemes (with A. Penfold Street), Faculty of Informatics - Papers (2000)
We present one way in which combinatorial designs can be used to give conditionally perfect...
Back circulant Latin squares and the influence of a set (with L. F. Fitina and G. R. Chaudhry), Faculty of Informatics - Papers (1999)
We define the notions of nest and influence of a subset of a critical set...
When the necessary conditions are not sufficient: sequences with zero autocorrelation function (with J. Horton), Faculty of Informatics - Papers (1999)
Recently K. T. Arasu (personal communication) and Yoseph Strassler, in his PhD thesis, The Classification...
On F-Squares and their Critical Sets (with L. F. Fitina and D. Sarvate), Faculty of Informatics - Papers (1999)
We define the notion of critical set of an F-square, following the definition of critical...
Crypto Topics And Applications I (with C. Charnes, J. Pieprzyk, and R. Safavi-Naini), Faculty of Informatics - Papers (1999)
In this chapter we discuss four related areas of cryptology, namely: Authentication, Hashing, Message Authentication...
Crypto Topics And Applications II (with C. Charnes, J. Pieprzyk, and R. Safavi-Naini), Faculty of Informatics - Papers (1999)
In this chapter we continue our exposition of the crypto topics which was begun in...
New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review (with C. Koukouvinos), Faculty of Informatics - Papers (1999)
The book, Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Marcel Dekker, New York-Basel, 1979, by...
On Circulant Weighing Matrices (with K. T . Arasu), Faculty of Informatics - Papers (1998)
Algebraic techniques are employed to obtain necessary conditions for the existence of certain circulant weighing...
Group Divisible Designs, GBRSDS And Generalized Weighing Matrices (with D. G. Sarvate), Faculty of Informatics - Papers (1998)
We give new constructions for regular group divisible designs, pairwise balanced designs, generalized Bhaskar Rao...
An experimental search and new combinatorial designs via a generalisation of cyclotomy (with Marc Gysin), Faculty of Informatics - Papers (1998)
Cyclotomy can be used to construct a variety of combinatorial designs, for example, supplementary difference...
Bose's method of differences applied to construct Bhaskar Rao designs, Faculty of Informatics - Papers (1998)
In this paper we show that BIBD(v,b,r,k,λ) where v = pq or pq + 1,...
Bose's Method of Differences Applied to Construct Bhaskar Rao Designs, Faculty of Informatics - Papers (1998)
In this paper we show that BIBD(v, b, r, k, λ), where v = pq...
Covert Distributed Computing Using Java Through Web Spoofing (with J. Horton), Faculty of Informatics - Papers (1998)
We use the Web Spoofing attack reported by Cohen and also the Secure Internet Programming...
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) (with M. Burmester and Y. Desmedt), Faculty of Informatics - Papers (1998)
With equitable key escrow the control of society over the individual and the control of...
Group divisible designs, GBRDSDS and generalized weighing matrices (with Dinesh G. Sarvate), Faculty of Informatics - Papers (1998)
We give new constructions for regular group divisible designs, pairwise balanced designs, generalized Bhaskar Rao...
Infinite families of generalized Bhaskar Rao designs, Faculty of Informatics - Papers (1998)
We show that GBRD(p,1/2(p-1), 1/8(p-1)(p-3);EA(1/2p-1)) exist for all prime powers p ≡ 3 (mod 4)....
Necessary and sufficient conditions for some two variable orthogonal designs in order 44 (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (1998)
We give a new algorithm which allows us to construct new sets of sequences with...
Numerical algorithms for the computation of the Smith normal form of integral matrices, (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (1998)
Numerical algorithms for the computation of the Smith normal form of integral matrices are described....
On New Families of Supplementary Difference Sets over Rings with Short Orbits (with M. Gysin), Faculty of Informatics - Papers (1998)
We discuss difference sets (DS) and supplementary difference sets (SDS) over rings. We survey some...
On the (10,5,$\lambda$)-family of Bhaskar Rao designs (with Ghulam R. Chaundhry), Faculty of Informatics - Papers (1998)
We prove a theorem for BRD(10,5,λ)s and give thirteen (13) inequivalent BRD(10,5,4)s
On the (10, 5, λ)-Family of Bhaskar Rao Designs (with G. Chaudhry), Faculty of Informatics - Papers (1998)
We prove a theorem for BRD(10,5,Lambda)s and give thirteen (13) inequivalent BRD(10,5,4)s.
Perfect Secret Sharing Schemes from Room Squares (with G. R. Chaudhry and H Ghodosi), Faculty of Informatics - Papers (1998)
Secret sharing schemes are one of the most important primitives in distributed systems. In perfect...
Some necessary and sufficient conditions for two variable orthogonal designs in order 44 (with Christos Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (1998)
We give a new algorithm which allows us to construct new sets of sequences with...
"Albert Leon Whiteman (1915-1995)" (with S. Golomb and T. Harris), Faculty of Informatics - Papers (1997)
The Mathematical Family Tree of Hans Rademacher (with A. Whiteman branch)
Computer Viruses An Introduction (with Jeffrey Horton), Faculty of Informatics - Papers (1997)
Computer viruses pose a considerable problem for users of personal computers. The recent emergence of...
How to prevent cheating in Pinch's scheme (with G. Hossein, J. Pieprzyk, and G. Chaundhry), Faculty of Informatics - Papers (1997)
A modified protocol is proposed which prevents cheating in the Online multiple secret sharing scheme...
Minimal Critical Set of a Room Square of order 7 (with Ghulam R. Chaudhry), Faculty of Informatics - Papers (1997)
A Room square R of order r is an r x r array each of...
On 4-NPAF(1,2w) sequences (with Marc Gysin), Faculty of Informatics - Papers (1997)
We give an overview on the existence of 4-NPAF (1,2w) sequences. We sketch some construction...
On the Smith normal form of weighing matrices (with Christos Koukouvinos and C. Mitrouli), Faculty of Informatics - Papers (1997)
The Smith normal forms (SNF) of weighing matrices are studied. We show that for all...
Optimal designs, supplementary difference sets and multipliers (with Christos Koukouvinos, A. L. Whiteman, and Xia Ming-yuan), Faculty of Informatics - Papers (1997)
We investigate multipliers of 2 - {v; q2, q2; λ} supplementary difference sets where cyclotomy...
Secure Access to Electronic Strongboxes in Electronic Commerce (with Thomas Hardjono), Faculty of Informatics - Papers (1997)
Two protocols for access to electronic strongbox are described in the context of electronic commerce....
Weighing matrices and their applications (with Christos Koukouvinos), Faculty of Informatics - Papers (1997)
Three major applications of weighing matrices are discussed. New weighing matrices and skew weighing matrices...
Beacons for authentication in distributed systems (with Azad Jiwa and Thomas Hardjono), Faculty of Informatics - Papers (1996)
Reliable authentication of communicating entities is essential for achieving security in a distributed computing environment....
Circulant weighing designs (with K. T. Arasu), Faculty of Informatics - Papers (1996)
Algebraic techniques are employed to obtain necessary conditions for the existence of certain families of...
Design and security issues in strongbox systems for the internet (with Thomas Hardjono), Faculty of Informatics - Papers (1996)
This paper presents and discusses some design and security issues surrounding electronic strongboxes as an...
Minimal and Maximal Critical Sets in Room Squares (with Ghulam Rasool Chaudhry), Faculty of Informatics - Papers (1996)
In this paper we introduce critical sets in Room squares. We give the cardinality of...
Multiplication of ternary complementary pairs (with Marc Gysin), Faculty of Informatics - Papers (1996)
We present a computer-search method for concatenating or "multiplying" binary or ternary complementary pairs. All...
Necessary and sufficient conditions for some two variable orthogonal designs in order 36 (with Christos Koukouvinos and Nikos Platis), Faculty of Informatics - Papers (1996)
We give new sets of sequences with entries from {0, ±a, ±b, ±c, ±d} on...
New weighing matrices (with Christos Koukouvinos), Faculty of Informatics - Papers (1996)
New weighing matrices and skew weighing matrices are given for many orders 4t ≤ 100....
On sufficient conditions for some orthogonal designs and sequences with zero autocorrelation function (with C. Koukouvinos, M. Mitrouli, and P. Karabelas), Faculty of Informatics - Papers (1996)
We give new sets of sequences with entries from {0, ±a, ±b, ±c, ±d} on...
On the Smith normal form of D-optimal designs (with Christos Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (1996)
The Smith normal forms (SNF) of V-optimal designs of size < 100 are determined by...
Secret Sharing schemes based on Room squares (with Ghulam Rasool Chaudhry), Faculty of Informatics - Papers (1996)
In this paper, we describe secret sharing schemes. We discuss Room squares and their critical...
Security issues in mobile information networks (with Thomas Hardjono), Faculty of Informatics - Papers (1996)
During the last decade the decrease in the size of computing machinery, coupled with the...
Shared cryptographic bits via quantized quandrature phase amplitudes of light (with Yi Mu and Yuliang Zheng), Faculty of Informatics - Papers (1996)
We propose a novel quantum cryptographic protocol without using polarized photons. The protocol consists of...
Strong boxes for electronic commerce (with Thomas Hardjono), Faculty of Informatics - Papers (1996)
As electronic commerce becomes a reality, additional services related to electronic commerce will also emerge....
Applications of smartcards for anonymous and verifiable databases (with Thomas Hardjono), Faculty of Informatics - Papers (1995)
In this paper we describe a practical solution towards anonymous and verifiable databases based on...
Information security in mobile databases (with Thomas Hardjono), Faculty of Informatics - Papers (1995)
During the last decade the decrease in the size of computing machinery, coupled with the...
Information security issues in mobile computing (with Thomas Hardjono), Faculty of Informatics - Papers (1995)
During the last decade the decrease in the size of computing machinery, coupled with the...
Latin squares: critical sets and their lower bounds (with Diane Donovan, Joan Cooper, and D. J. Nott), Faculty of Informatics - Papers (1995)
In this paper we establish a number of new lower bounds on the size of...
New normal sequences of length 25 (with Marc Gysin), Faculty of Informatics - Papers (1995)
An introduction to binary sequences, combinatorial designs and how they are related to communication theory...
Nonlinearity and Propagation Characteristics of Balanced Boolean Functions (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1995)
Three important criteria for cryptographically strong Boolean functions are balance, nonlinearity, and the propogation criterion....
Relating Nonlinearity to Propagation Characteristics (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1995)
The connections among the various nonlinearity criteria is currently an important topic in the area...
Relationship among Nonlinearity Criteria (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1995)
An important question in designing cryptographic functions including substitution boxes (S-boxes) is the relationships among...
Structures of cryptographic functions with strong avalanche characteristics (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1995)
This paper studies the properties and constructions of non linear functions, which are a core...
The relationship between propagation characteristic and nonlinearity of cryptographic functions (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1995)
The connections among the various nonlinearity criteria is currently an important topic in the area...
The weighing matrices of order 4n and weight 4n-2 and 2n-1 (with Marc Gysin), Faculty of Informatics - Papers (1995)
We give algorithms and constructions for mathematical and computer searches which allow us to establish...
A few more small defining sets for SBIBD(4t-1, 2t-1, t-1) (with Thomas Kunkle), Faculty of Informatics - Papers (1994)
It has been conjectured by Dinesh Sarvate and Jennifer Seberry, that, when p is an...
Anonymous and verifiable databases: towards a practical solution (with Thomas Hardjono and Yuliang Zheng), Faculty of Informatics - Papers (1994)
In this paper we describe a practical solution towards anonymous and verifiable databases based on...
A note on small defining sets for some SBIBD(4t-1, 2t-1, t-1) (with Dinesh Sarvate), Faculty of Informatics - Papers (1994)
We conjecture that p specified sets of p elements are enough to define an SBIBD(2p+...
Authentication via multi-service tickets in the Kuperee server (with Thomas Hardjono), Faculty of Informatics - Papers (1994)
The subject of this paper is the authentication services as found in the Kuperee3 server....
Beacon based authentication (with Azad Jiwa and Yuliang Zheng), Faculty of Informatics - Papers (1994)
Reliable authentication of communicating entities is essential for achieving security in a distributed computing environment....
Comments on "Generating and Counting Binary Bent Sequences" (with Claude Carlet and Xian-Mo Zhang), Faculty of Informatics - Papers (1994)
We prove that the conjecture on bent sequences stated in"Generating and counting bent sequences". IEEE...
Constructions of bent functions from two known bent functions (with Xian-Mo Zhang), Faculty of Informatics - Papers (1994)
A (1, -1)-matrix will be called a bent type matrix if each row and each...
Cryptographic boolean functions via group Hadamard matrices (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1994)
For any integers n,m, 2n > m > n we construct a set of boolean...
Database Authentication Revisited (with Thomas Hardjono and Yuliang Zheng), Faculty of Informatics - Papers (1994)
Database authentication via cryptographic checksums represents an important approach to achieving an affordable safeguard of...
How to improve the SAC (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1994)
This paper presents a simple yet effective method for transforming Boolean functions that do not...
Improving the strict avalanche characteristics of cryptographic functions (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1994)
This paper presents a simple yet effective method for transforming Boolean functions that do not...
Kerbie: Kerberos-type authentication using public-keys (with Thomas Hardjono and Yuliang Zheng), Faculty of Informatics - Papers (1994)
Kerberos-type authentication protocols have more to offer when they are founded upon public key cryptosystems....
Multiplication of sequences with zero autocorrelation (with Christos Koukouvinos, Stratis Kounias, C. H. Yang, and Joel Yang), Faculty of Informatics - Papers (1994)
Near normal sequences of new lengths n = 4m + 1 = 49,53,57 are constructed....
New results with near- Yang sequences (with Marc Gysin), Faculty of Informatics - Papers (1994)
We construct new TW -sequences, weighing matrices and orthogonal designs using near-Yang sequences. In particular...
Nonlinearity and propagation characteristics of balanced boolean functions (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1994)
Three of the most important criteria for cryptographically strong Boolean functions are the balancedness, the...
On construction and nonlinearity of correlation immune functions (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1994)
A Boolean function is said to be correlation immune if its output leaks no information...
On sequences with zero autocorrelation (with Christos Koukouvinos, Stratis Kounias, C. H. Yang, and Joel Yang), Faculty of Informatics - Papers (1994)
Normal sequences of lengths n = 18, 19 are constructed. It is proved through an...
On the existence of Turyn sequences of length less than 43 (with Genet M. Edmondson and Malcolm R. Anderson), Faculty of Informatics - Papers (1994)
Some theoretical results and computational algorithms are described which verify previous calculations, prove some theoretical...
Pitfalls in designing substitution boxes (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1994)
Two significant recent advances in cryptanalysis, namely the differential attack put forward by Biham and...
Reusing Shares in Secret Sharing Schemes (with Yuliang Zheng and Thomas Hardjono), Faculty of Informatics - Papers (1994)
A (t, w) threshold scheme is a method for sharing a secret among w shareholders...
Secret sharing schemes arising from latin squares (with Joan Cooper and Diane Donovan), Faculty of Informatics - Papers (1994)
A critical set in a latin square is a partial latin square which has a...
Structures of highly nonlinear cryptographic functions (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1994)
This paper studies the properties and constructions of nonlinear Boolean functions, which are a core...
The strong Kronecker product (with Warwick de Launey), Faculty of Informatics - Papers (1994)
The strong Kronecker product has proved a powerful new multiplication tool for orthogonal matrices. This...
Constructions of balanced ternary designs based on generalized Bhaskar Rao designs (with Dinesh G. Sarvate), Faculty of Informatics - Papers (1993)
New series of balanced ternary designs and partially balanced ternary designs are obtained. Some of...
HAVAL - A one-way hashing algorithm with variable length output (with Yuliang Zheng and Josef Pieprzyk), Faculty of Informatics - Papers (1993)
A one-way hashing algorithm is a deterministic algorithm that compresses an arbitrary long message into...
Highly nonlinear 0-1 balanced boolean functions satisfying strict avalanche criterion (with Xian-Mo Zhang), Faculty of Informatics - Papers (1993)
Nonlinearity, 0-1 balancedness and strict avalanche criterion (SAC) are important criteria for cryptographic functions. Bent...
Immunizing public key cryptosystems against chosen ciphertext attacks (with Christos Koukouvinos), Faculty of Informatics - Papers (1993)
This paper presents three methods for strengthening public key cryptosystems in such a way that...
Improving resistance to differential cryptanalysis and the redesign of LOKI (with Lawrence P. Brown, Matthew Kwan, and Joseph Pieprzyk), Faculty of Informatics - Papers (1993)
Differential Cryptanalysis is currently the most powerful tool available for analysing block ciphers, and new...
On G-matrices (with Christos Koukouvinos), Faculty of Informatics - Papers (1993)
G-matrices for the new orders 21, 23, 25 and 27 are constructed. Some constructions for...
On the multiplication theorems of Hadamard matrices of generalized quaternion type using M-structures (with Mieko Yamada), Faculty of Informatics - Papers (1993)
We show that M-structures can be extended to Hadamard matrices of generalized quaternion type and...
On weighing matrices (with Christos Koukouvinos), Faculty of Informatics - Papers (1993)
We give new sets of {0, 1, -1} sequences with zero autocorrelation function, new constructions...
Practical proven secure authentication with arbitration (with Yvo Desmedt), Faculty of Informatics - Papers (1993)
Proven secure signature schemes and unconditionally secure authentication schemes with arbiter have been proposed. The...
Regular sets of matrices and applications (with Xian-Mo Zhang), Faculty of Informatics - Papers (1993)
Suppose A1,....,As are (1, -1) matrices of order m satisfying
AiAj=J, i,jє{1,...,s}
AtiAj=AtjAi=J, i≠j, i,jє{1,...,s}
...Some new weighing matrices using sequences with zero autocorrelation function (with Christos Koukouvinos), Faculty of Informatics - Papers (1993)
We verify the skew weighing matrix conjecture for orders 2t.13, t ≥ 5, and give...
Some orthogonal matrices constructed by strong Kronecker multiplication (with Xian-Mo Zhang), Faculty of Informatics - Papers (1993)
Strong Kronecker multiplication of two matrices is useful for constructing new orthogonal matrices from those...
Systematic generation of cryptographically robust S-boxes (with Xian-Mo Zhang and Yuliang Zheng), Faculty of Informatics - Papers (1993)
Substitution boxes (S-boxes) are a crucial component of DES-like block ciphers. This research addresses problems...
The excess of complex Hadamard matrices (with H. Kharaghani), Faculty of Informatics - Papers (1993)
A complex Hadamard matrix, C, of order n has elements 1, -1, i, - i...
A cubic RSA code equivalent to factorization (with John Loxton, David S.P. Khoo, and Gregory J. Bird), Faculty of Informatics - Papers (1992)
The RSA public-key encryption system of Rivest, Shamir, and Adelman can be broken if the...
Constructing Hadamard matrices from orthogonal designs (with Christos Koukouvinos), Faculty of Informatics - Papers (1992)
The Hadamard conjecture is that Hadamard matrices exist for all orders 1,2, 4t where t...
Hadamard matrices, Sequences, and Block Designs (with Mieko Yamada), Faculty of Informatics - Papers (1992)
One hundred years ago, in 1893, Jacques Hadamard [31] found square matrices of orders 12...
On small defining sets for some SBIBD(4t - 1, 2t - 1, t - 1), Faculty of Informatics - Papers (1992)
We conjecture that 2t - 1 specified sets of 2t - 1 elements are enough...
On small defining sets for some SBIBD(4t-1, 2t-1, t-1), Faculty of Informatics - Papers (1992)
We conjecture that 2t - 1 specified sets of 2t - 1 elements are enough...
Product of four Hadamard matrices (with R. Craigen and Xian-Mo Zjhang), Faculty of Informatics - Papers (1992)
We prove that if there exist Hadamard matrices of order 4m, 4n, 4p, and 4q...
Resolvable designs applicable to cryptographic authentication schemes (with Keith M. Martin and Peter Wild), Faculty of Informatics - Papers (1992)
We consider certain resolvable designs which have application to doubly perfect cartesian authentication schemes. These...
Selected Papers in Combinatorics - a Volume Dedicated to R.G. Stanton (with Brendan McKay and Scott Vanstone), Faculty of Informatics - Papers (1992)
Professor Stanton has had a very illustrious career. His contributions to mathematics are varied and...
Semi Williamson type matrices and the W(2n, n) conjecture (with Xian-Mo Zhang), Faculty of Informatics - Papers (1992)
Four (1, -1, 0)-matrices of order m, X = (Xij), Y = (Yij), Z =...
‘”Suggestions for presentation of a twenty-minute talk”’ (with Dinesh Sarvate), Faculty of Informatics - Papers (1992)
How to present a research talk which will be remembered for a long(!) time for...
Addendum to further results on base sequences, disjoint complementary sequences, OD(4t; t, t, t, t) and the excess of Hadamard matrices (with Christos Koukouvinos), Faculty of Informatics - Papers (1991)
It is known that if there are base sequences of lengths m + p, m...
A generalised testbed for analysing block and stream ciphers (with Lawrence Brown, Josef Pieprzyk, and Reihaneh Safavi-Naini), Faculty of Informatics - Papers (1991)
With the recent development of a number of new ciphers, especially block ciphers, there is...
Amicable Hadamard matrices and amicable orthogonal designs (with Mieko Yamada), Faculty of Informatics - Papers (1991)
New constructions for amicable orthogonal designs are given. These new designs then give new amicable...
Error-correcting codes for authentication and subliminal channels (with Reihaneh Safavi-Naini), Faculty of Informatics - Papers (1991)
The application of coding theory to security scenarios is studied. Authentication systems are introduced that...
Existence of SBIBD(4k2, 2k2 + k, k2 + k) and Hadamard matrices with maximal excess, Faculty of Informatics - Papers (1991)
It is shown that SBIBD( 4k2, 2k2 ± k, k2 ± k) and Hadamard matrices...
Generalized Bhaskar Rao designs with elements from cyclic groups of even order (with Andrew Bowler and Kathleen Quinn), Faculty of Informatics - Papers (1991)
A necessary condition is given for the existence of some Generalised Bhaskar Rao designs (GBRDs)...
Hadamard matrices of order ? (8 mod 16) with maximal excess (with Christos Koukouvinos), Faculty of Informatics - Papers (1991)
Kounias and Farmakis, in 'On the excess of Hadamard matrices', Discrete Math. 68 (1988) 59-69,...
Latin squares and critical sets of minimal size (with Joan Cooper and Diane Donovan), Faculty of Informatics - Papers (1991)
This paper discusses critical sets for latin squares. We give the cardinality of the minimal...
Some orthogonal designs and complex Hadamard matrices by using two Hadamard matrices (with Xian-Mo Zhang), Faculty of Informatics - Papers (1991)
We prove that if there exist Hadamard matrices of order h and n divisible by...
Supplementary difference sets and optimal designs (with Christos Koukouvinos and Stratis Kounias), Faculty of Informatics - Papers (1991)
D-optimal designs of order n = 2v ≡ 2 (mod 4), where q is a...
Further results on base sequences, disjoint complementary sequences, OD(4t; t, t, t, t) and the excess of Hadamard matrices (with Christos Koukouvinos and Stratis Kounias), Faculty of Informatics - Papers (1990)
We obtain new base sequences, that is four sequences of lengths m + p, m...
Key scheduling DES type cryptosystems (with Lawrence Brown), Faculty of Informatics - Papers (1990)
This paper reviews some possible design criteria for the key schedule in a DES style...
LOKI - A cryptographic primitive for authentication and secrecy applications (with Lawrence Brown and Josef Pieprzyk), Faculty of Informatics - Papers (1990)
This paper provides an overview of the LOKI encryption primitive which may be used to...
On the design of permutation P in DES type cryptosystems (with Lawrence Brown), Faculty of Informatics - Papers (1990)
This paper reviews some possible design criteria for the permutation P in a DES style...
On the products of Hadamard matrices, Williamson matrices and other orthogonal matrices using M-structures (with Mieko Yamada), Faculty of Informatics - Papers (1990)
The new concept of M-structures is used to unify and generalize a number of concepts...
Search key substitution in the encipherment of B-trees (with Thomas Hardjono), Faculty of Informatics - Papers (1990)
This paper suggests an improvement to the scheme by Bayer and Metzger for the encipherment...
Some remarks on authentication systems (with Martin HG Anthony, Keith M. Martin, and Peter Wild), Faculty of Informatics - Papers (1990)
Brickell, Simmons and others have discussed doubly perfect authentication systems in which an opponent's chance...
A multilevel encryption scheme for database security (with Thomas Hardjono), Faculty of Informatics - Papers (1989)
An encryption scheme is proposed which allows a hierarchical organization of keys used to encrypt...
A survey of base sequences, disjoint complementary sequences and OD(4t; t, t, t, t) (with Gavin Cohen, David Rubie, Christos Koukouvinos, Stratis Kounias, and Mieko Yamada), Faculty of Informatics - Papers (1989)
We survey the existence of base sequences, that is four sequences of lengths m +...
Cryptographic techniques, Faculty of Informatics - Papers (1989)
The public key cryptosystem published by Diffie and Hellman in 1976 is still of great...
Experience of using a type signature password system for user authentication in a heavily used computing environment (with Mike Newberry), Faculty of Informatics - Papers (1989)
This paper describes a user authentication system based around the user's type signature, a statistical...
Products of Hadamard matrices, Williamson matrices and other orthogonal matrices using M-structures (with Mieko Yamada), Faculty of Informatics - Papers (1989)
The new concept of M-structures is used to unify and generalize a number of concepts...
Pseudo-random sequence generators using structured noise (with R S. Safavi-Naini), Faculty of Informatics - Papers (1989)
Stream ciphers use the output of a Pseudo-Random (PR) generator to mask the information stream....
Relative compromise of statistical databases (with M Miller), Faculty of Informatics - Papers (1989)
Statistical databases are databases in which only statistical type of queries are allowed. The results...
SBIBD(4k², 2k² + k, k² + k) and Hadamard matrices of order 4k² with maximal excess are equivalent, Faculty of Informatics - Papers (1989)
We show that an SBIBD(4k², 2k² + k, k² + k) is equivalent to a...
User unique identification (with Terry Jones and Mike Newberry), Faculty of Informatics - Papers (1989)
Traditionally, users have been authenticated by asking them to provide some form of password. This...
Bhaskar Rao designs over small groups (with William D. Palmer), Faculty of Informatics - Papers (1988)
We show that for each of the groups S3, D4, Q4, Z4 x Z2 and...
New Hadamard matrices and conference matrices obtained via Mathon's construction (with Albert L. Whiteman), Faculty of Informatics - Papers (1988)
We give a formulation, via (1, - 1) matrices, of Mathon's construction for conference matrices...
On weighing matrices with square weights (with D G. Sarvate), Faculty of Informatics - Papers (1988)
We give a new construction for a known family of weighing matrices using the 2-adjugate...
Some results on the excesses of Hadamard matrices (with Brett A. Jenkins, C Koukouvinos, S Kounias, and Ralph Seberry), Faculty of Informatics - Papers (1988)
We give some results on the excess of Hadamard matrices. We give a list for...
A construction for orthogonal designs with three variables, Faculty of Informatics - Papers (1987)
We show how orthogonal designs OD(48p²t;16p²t, 16p²t,16p²t) can be constructed from an Hadamard matrix of...
A note on orthogonal designs (with J Hammer and D G. Sarvate), Faculty of Informatics - Papers (1987)
We extend a method of Kharaghani and obtain some new constructions for weighing matrices and...
Coloured designs, new group divisible designs and pairwise balanced designs (with C A. Rodger and Dinesh G. Sarvate), Faculty of Informatics - Papers (1987)
Many new families of group divisible designs, balanced incomplete block designs and pairwise balanced designs...
Constructing Hadamard matrices via orthogonal designs, Faculty of Informatics - Papers (1987)
Orthogonal designs were created to give a unifying approach to the construction of Hadamard matrices....
Electronic funds transfer point of sale in Australia (with Ralph Gyoery), Faculty of Informatics - Papers (1987)
The Australia wide eftpos systems was developed by the Australian Retail Banks to meet Australian...
Generalized Hadamard matrices and colourable designs in the construction of regular GDDs with two and three association classes, Faculty of Informatics - Papers (1987)
Generalized Hadamard matrices and colourable designs are used to construct many new group divisible designs.
On Hadamard matrices of order 2t pq:I, Faculty of Informatics - Papers (1987)
We prove a new result for orthogonal designs showing if all full orthogonal designs, OD...
Public key cryptography, Faculty of Informatics - Papers (1987)
We are going to devote most of our attention in this talk to the RSA...
Vanstone's construction applied to Bhaskar Rao designs, Faculty of Informatics - Papers (1987)
We show how Vanstone's construction, given in his paper "A note on a construction for...
A new construction for Williamson-type matrices, Faculty of Informatics - Papers (1986)
It is shown that if q is a prime power then there are Williamson-type matrices...
Authentication without secrecy (with Terry C. Jones), Faculty of Informatics - Papers (1986)
Recently, Seberry proposed a method for subliminal message transmission over an insecure channel in the...
Encryption methods based on combinatorial designs (with Dinesh G. Sarvate), Faculty of Informatics - Papers (1986)
We explore the use of some combinatorial designs for possible use as secret codes. We...
On inequivalent weighing matrices (with H C. Chan and C A. Rodger), Faculty of Informatics - Papers (1986)
A weighing matrix W = W(n,k) of order n and weight k is a square...
A subliminal channel in codes for authentication without secrecy, Faculty of Informatics - Papers (1985)
G.J. Simmons has advanced the concept of using authentication in an open channel to actually...
Generalised Bhaskar Rao designs of block size 3 over the group Z4 (with Warwick de Launey and Dinesh G. Sarvate), Faculty of Informatics - Papers (1985)
We show that the necessary conditions (i) 2tv(v-l) ≡ O(mod 3) (ii) v ≥ 3...
Generalized Bhaskar Rao designs with block size three, Faculty of Informatics - Papers (1985)
We show that the necessary conditions λ = 0 (mod IGI), λ(v-l)=0 (mod2), λv(v 1)...
Generalized Bhaskar Rao designs (with Clement Lam), Faculty of Informatics - Papers (1984)
Generalized Bhaskar Rao designs with non-zero elements from an abelian group G are constructed. In...
Maximal ternary codes and Plotkin's bound (with Conrad Mackenzie), Faculty of Informatics - Papers (1984)
The analogue of Plotkin's bound is developed for ternary codes with high distance relative to...
On Bhaskar Rao designs of block size four (with Warwick de Launey), Faculty of Informatics - Papers (1984)
We show that Bhaskar Rao designs of type BRD(v, b, r, 4, 6) exist for...
Regular group divisible designs and Bhaskar Rao designs with block size three, Faculty of Informatics - Papers (1984)
Some recursive constructions are given for Bhaskar Rao designs. Using examples of these designs found...
The directed packing numbers DD(t, v ,v), t ≥ 4 (with J E. Dawson and D B. Skillicorn), Faculty of Informatics - Papers (1984)
A directed packing is a maximal collection of k-subsets, called blocks, of a set of...
On orthogonal matrices with constant diagonal (with Clement WH Lam), Faculty of Informatics - Papers (1982)
In connection with the problem of finding the best projections of k-dimensional spaces embedded in...
Some families of partially balanced incomplete block designs, Faculty of Informatics - Papers (1982)
Bhaskar Rao designs with elements from abelian groups are defined and it is shown how...
Some remarks on the permanents of circulant (0,1) matrices (with Peter Eades and Cheryl E. Praeger), Faculty of Informatics - Papers (1982)
Some permanents of circulant (0,1) matrices are computed. Three methods are used. First, the permanent...
The skew - weighing matrix conjecture, Faculty of Informatics - Papers (1982)
We review the history of the skew-weighing matrix conjecture and show that there exist skew-symmetric...
Higher dimensional orthogonal designs and applications (with Joseph Hammer), Faculty of Informatics - Papers (1981)
When n2 elements are given, they can be arranged in the form of a square;...
Higher dimensional orthogonal designs and Hadamard matrices (with Joseph Hammer), Faculty of Informatics - Papers (1981)
When n2 elements are given they can be arranged in the form of a square,...
A construction for generalized Hadamard matrices, Faculty of Informatics - Papers (1980)
We prove that if pv and pr -1 are both prime powers then there is...
All DBIBDs with block size four exist (with Deborah J. Street), Faculty of Informatics - Papers (1980)
A directed balanced incomplete block design with parameters (v,b,r,k,λ*), is a balanced incomplete block design...
All directed BIBDs with k = 3 exist (with David Skillicorn), Faculty of Informatics - Papers (1980)
A directed BIBD with parameters (v,b,r,k,λ*) is a BIBD with parameters (v, b, r, k,...
An infinite family of skew-weighing matrices, Faculty of Informatics - Papers (1980)
We show that orthogonal designs of type (l,k) exist for all k = 0,1,...,2 .15-1,...
Complex weighing matrices and orthogonal designs (with Albert L. Whiteman), Faculty of Informatics - Papers (1980)
Galois fields G,F(q2) are used to obtain a new infinite family of complex weighing matrices....
Some infinite classes of Hadamard matrices, Faculty of Informatics - Papers (1980)
A recursive method of A. C. Mukhopadhay is used to obtain several new infinite classes...
Some remarks on amicable orthogonal designs, Faculty of Informatics - Papers (1980)
We present some new results on amicable orthogonal designs. We obtain amicable Hadamard matrices of...
A note on orthogonal Graeco-Latin designs, Faculty of Informatics - Papers (1979)
It is shown that Graeco-Latin block designs which have treatments totally balanced with respect to...
Higher-dimensional orthogonal designs and Hadamard matrices II (with J Hammer), Faculty of Informatics - Papers (1979)
Higher-dimensional orthogonal designs of type (l,l)n are used to obtain higher-dimensional weighing matrices of type...
On the distribution of the permanent of cyclic (0,1) matrices (with Evi Nemeth and Michael Shu), Faculty of Informatics - Papers (1979)
Some results are obtained on the permanent of cyclic (0,1) matrices which support the conjecture...
Ordered partitions and codes generated by circulant matrices (with R Razen and K Wehrhahn), Faculty of Informatics - Papers (1979)
We consider the set of ordered partitions of n into m parts acted upon by...
Some remarks on generalised Hadamard matrices and theorems of Rajkundlia on SBIBDs, Faculty of Informatics - Papers (1979)
Constructions are given for generalised Hadamard matrices and weighing matrices with entries from abelian groups....
Women in mathematics in Australia, Faculty of Informatics - Papers (1979)
Many people believe women cannot "do" mathematics. This is not true, Tables 1, 2 and...
A class of codes generated by circulant weighing matrices (with K Wehrhahn), Faculty of Informatics - Papers (1978)
Some properties of a new class of codes constructed using circulant matrices over GF(3) will...
A computer listing of Hadamard matrices, Faculty of Informatics - Papers (1978)
A computer has been used to list all known Hadamard matrices of order less than...
A remark on the excess of Hadamard matrices and orthogonal designs (with J Hammer and R Levingston), Faculty of Informatics - Papers (1978)
Some improved upper and lower bounds are given for the excess of Hadamard matrices. The...
Generation of a frequency square orthogonal to a 10 x 10 Latin square (with H C. Kirton), Faculty of Informatics - Papers (1978)
In general it is a difficult if not impossible task to find a latin square...
On skew Hadamard matrices, Faculty of Informatics - Papers (1978)
Recently I have proved that for every odd integer q there exists integers t and...
On the structure and existence of some amicable orthogonal designs (with Peter J. Robinson), Faculty of Informatics - Papers (1978)
The structure is determined for the existence of some amicable weighing matrices. This is then...
An algorithm for the permanent of circulant matrices (with Larry J. Cummings), Faculty of Informatics - Papers (1977)
The permanent of an n x n matrix A = (a;j) is the matrix function...
A note on asymptotic existence results for orthogonal designs (with Peter Eades and Nicholas Wormald), Faculty of Informatics - Papers (1977)
In a recent manuscript "Some asymptotic results for orthogonal designs" Peter Eades showed that for...
Orthogonal Designs in powers of two (with Peter J. Robinson), Faculty of Informatics - Papers (1977)
Repeat designs are introduced and it is shown how they may be used to give...
An infinite family of skew weighing matrices (with Peter Eades), Faculty of Informatics - Papers (1976)
We verify the skew weighing matrix conjecture for orders 2t.7, t ~ 3 a positive...
A note on orthogonal designs in order eighty (with Joan Cooper), Faculty of Informatics - Papers (1976)
This is a short note showing the existence of all twovariable designs in order 80...
A note on using sequences to construct orthogonal designs (with Peter J. Robinson), Faculty of Informatics - Papers (1976)
Several constructions are given which show how to construct orthogonal designs from sequences of commuting...
Designs from cyclotomy (with Elizabeth J. Morgan and Anne P. Street), Faculty of Informatics - Papers (1976)
In this note we use the theory of cyclotomy to help us construct initial blccks...
“George Szekeres” (with J R. Giles), Faculty of Informatics - Papers (1976)
George Szekcres was born in Budapest on 29th May, 1911 the second of three sons...
On the Existence of Hadamard Matrices, Faculty of Informatics - Papers (1976)
Given any natural number q > 3 we show there exists an integer t ≤...
Orthogonal designs V: Orders divisible by eight, Faculty of Informatics - Papers (1976)
Constructions are given for orthogonal designs in orders divisible by eight. These are then used...
Reduction of angular momentum expressions by matrix arithmetic (with D. J. Newman), Faculty of Informatics - Papers (1976)
In perturbation calculations using basis states defined in terms of spherically symmetric potentials it is...
Some asymptotic results for orthogonal designs: II (with Peter Eades), Faculty of Informatics - Papers (1976)
In a recent manuscript « Some asymptotic results for orthogonal designs » Peter Eades showed...
Some New Constructions for Orthogonal Designs (with Anthony V. Geramita), Faculty of Informatics - Papers (1976)
We give three new constructions for orthogonal designs using amicable orthogonal designs. These are then...
Using cyclotomy to construct orthogonal designs (with Joan Cooper), Faculty of Informatics - Papers (1976)
An orthogonal design of order n and type (s1, S2) on the commuting variables x1,...
An algorithm for orthogonal designs (with Peter Eades, Peter J. Robinson, and Ian S. Williams), Faculty of Informatics - Papers (1975)
Let A =(si) be an n-tuple of positive integers such that Esi = 2k. We...
Construction of amicable orthogonal designs, Faculty of Informatics - Papers (1975)
Infinite families of amicable orthogonal designs are constructed with
(i) both of type (1, q)...
Construction of Williamson type matrices, Faculty of Informatics - Papers (1975)
Recent advances in the construction of Hadamard matrices have depended on the existence of Baumert-Hall...
On Hadamard matrices, Faculty of Informatics - Papers (1975)
Recent advances in the construction of Hadamard matrices have depended on the existence of Baumert-Hall...
On the matrices used to construct Baumert-Hall arrays (with Richard B. Lakein), Faculty of Informatics - Papers (1975)
Four circulant (or type 1) (0,1,-1) matrices X1, X2, X3, X4 of order t with...
Orthogonal designs (with Anthony V. Geramita and Joan Murphy Geramita), Faculty of Informatics - Papers (1975)
Orthogonal designs of special type have been extensively studied, and it is the existence of...
Orthogonal designs: II (with Anthony V. Geramita), Faculty of Informatics - Papers (1975)
Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to...
Orthogonal designs IV: Existence questions (with Anthony V. Geramita), Faculty of Informatics - Papers (1975)
In [5] Raghavarao showed that if n = 2 (mod 4) and A is a...
Some results on weighing matrices (with Albert Leon Whiteman), Faculty of Informatics - Papers (1975)
It is shown that if q is a prime power then there exists a circulant...
A note on supplementary difference sets, Faculty of Informatics - Papers (1974)
Let S1, S2,···, Sn be subsets of G, a finite abelian group of order v,...
A survey of orthogonal designs (with Anthony V. Geramita), Faculty of Informatics - Papers (1974)
This paper surveys orthogonal designs which are an overview of Baumert-Hall arrays, Hadamard matrices and...
Families of weighing matrices (with Anthony V. Geramita and Norman J. Pullman), Faculty of Informatics - Papers (1974)
A weighing matrix is an n x n matrix W = W(n, k) with entries...
Orthogonal designs III: Weighing matrices (with Anthony V. Geramita), Faculty of Informatics - Papers (1974)
A weighing matrix W = W(n,k) of order n and weight k is a square...
Williamson matrices of even order, Faculty of Informatics - Papers (1974)
Recent advances in the construction of Hadamard matrices have depended on the existence of Baumert-Hall...
A list of balanced incomplete block designs for r < 30 (with Jane W. Di Paola and W D. Wallis), Faculty of Informatics - Papers (1973)
A balanced incomplete block design consists of a set of v elements arranged into b...
A note on amicable Hadamard matrices, Faculty of Informatics - Papers (1973)
The existence of Szekeres difference sets, X and Y, of size 2f with y E...
A note on BIBDS, Faculty of Informatics - Papers (1973)
A balanced incomplete block design or BlBD is defined as an arrangement of v objects...
Complex Hadamard matrices, Faculty of Informatics - Papers (1973)
R. J. Turyn introduced complex Hadamard matrices and showed that if there is a complex...
Families of codes from orthogonal (0,1,-1)-matrices, Faculty of Informatics - Papers (1973)
Sloane and Seidel have constructed (n,2n,1/2(n-2)) and (n-1,2n,1/2(n-2)) codes whenever n = 1 + a2...
Hadamard matrices of order 28m, 36m, and 44m, Faculty of Informatics - Papers (1973)
We show that if four suitable matrices of order m exist then there are Hadamard...
Kronecker products and BIBDS, Faculty of Informatics - Papers (1973)
Recursive constructions are given which permit, under conditions described in the paper, a (v, b,...
Recent advances in the construction of Hadamard matrices, Faculty of Informatics - Papers (1973)
In the past few years exciting new discoveries have been made in constructing Hadamard matrices....
Some matrices of Williamson type, Faculty of Informatics - Papers (1973)
Recent advances in the construction of Hadamard matrices have depended on the existence of Baumert-Hall...
Some remarks on supplementary difference sets, Faculty of Informatics - Papers (1973)
Let S1,S2 ,... ,Sn be subsets of V, a finite abelian group of order v...
A construction for Hadamard arrays (with Joan Cooper), Faculty of Informatics - Papers (1972)
We give a construction for Hadamard arrays and exhibit the arrays of orders 4t ,...
Cyclotomy, Hadamard arrays and supplementary difference sets (with David C. Hunt), Faculty of Informatics - Papers (1972)
A 4n x 4n Hadamard array, H, is a square matrix of order 4n with...
On integer matrices obeying certain matrix equations, Faculty of Informatics - Papers (1972)
We discuss integer matrices B of odd order v which satisfy
Br = ± B,...
On supplementary difference sets, Faculty of Informatics - Papers (1972)
Given a finite abelian group V and subsets S1, S2, ... ,Sn of V, write...
Orthogonal (0,1,-1) matrices, Faculty of Informatics - Papers (1972)
We study the conjecture: There exists a square (0,l,-l)-matrix W = W(w,k) of order w...
Some classes of Hadamard matrices with constant diagonal (with Albert Leon Whiteman), Faculty of Informatics - Papers (1972)
The concepts of circulant and back circulant matrices are generalized to obtain incidence matrices of...
Amicable Hadamard matrices, Faculty of Informatics - Papers (1971)
If X is a symmetric Hadamard matrix, Y is a skew-Hadamard matrix, and XYT is...
A skew-Hadamard matrix of order 92, Faculty of Informatics - Papers (1971)
Previously the smallest order for which a skew-Hadamard matrix was not known was 92. We...
Combinatorial matrices, Faculty of Informatics - Papers (1971)
We investigate the existence of integer matrices B satisfying the equation BBT = rI +...
Integer matrices obeying generalized incidence equations, Faculty of Informatics - Papers (1971)
We consider integer matrices obeying certain generalizations of the incidence equations for (v, k, lambda)-configurations...
Some (1, -1) Matrices, Faculty of Informatics - Papers (1971)
We define an n-type (1, -1) matrix N = 1 + R of order n...
Some results on configurations, Faculty of Informatics - Papers (1971)
A (v, k, lambda) configuration is conjectured to exist for every v, k and lambda...
Hadamard designs, Faculty of Informatics - Papers (1970)
In this paper it is shown that an Hadamard design with each letter repeated once...
(v, k, lambda)-configurations and Hadamard matrices, Faculty of Informatics - Papers (1970)
(v, k, lambda) Configirations and Hadamard matrics
A class of Hadamard matrices, Faculty of Informatics - Papers (1969)
Whenever there exists a quasi-skew Hadamard matrix of order 4m and (4n - I, k,...
A Note of a Class of Hadamard Matrices, Faculty of Informatics - Papers (1969)
An Hadamard matrix H is a matrix of order n all of whose elements are...
Equivalence of Hadamard matrices (with W. D. Wallis), Faculty of Informatics - Papers (1969)
Suppose In is a square-free odd integer, and A and B are any two Hadamard...
Two new block designs, Faculty of Informatics - Papers (1969)
In this note the matrices W, X. Y, and Z are the incidence matrices of...