- Some new constructions of imprimitive cometric association schemes
- CIMPA Philippines Semidefinite Prog. in Alg. Combin.
- Minimum distance bounds for sregular Dedicated to Jaap Seidel on the occasion of his 80th birthday
- Mixed Block Designs William J. Martin 1
- Linear Programming Bounds for Ordered Orthogonal Arrays and (T; M;S)nets
- Project Number: MA-WJM-9800 Semidefinite Programming and its Application to the Sensor Network Localization Problem
- UNIFORMITY IN ASSOCIATION SCHEMES AND COHERENT CONFIGURATIONS: COMETRIC Q-ANTIPODAL SCHEMES
- Project Number: WJM5000 SRAM PUF Analysis and Fuzzy Extractors
- Completely regular codes a viewpoint and some W. J. Martin
- Arithmetic completely regular codes J. H. Koolen #, + W. S. Lee + W. J. Martin #
- Submitted exclusively to the London Mathematical Society DOI: 10.1112/S0000000000000000
- Completely Regular Designs William J. Martin 1
- CIMPA Philippines Semidefinite Prog. in Alg. Combin.
- Completely regular codes { a viewpoint and some W. J. Martin
- Distanceregular graphs having an eigenvalue of small multiplicity
- Project Number: CS-DJD-VFAC Model Checking for Role-Based Access Control
- Symmetric designs, sets with two intersection numbers and Krein
- A generalized Rao bound for ordered orthogonal arrays and (t; m; s)nets
- FINAL REPORT Submitted by
- A Provably Secure True Random Number Generator with Built-in Tolerance to Active Attacks
- Designs in Product Association Schemes William J. Martin 1
- Characterizing completely regular codes from an algebraic viewpoint
- CIMPAUNESCO PHILIPPINES RESEARCH SCHOOL ON SEMIDEFINITE PROGRAMMING IN ALGEBRAIC COMBINATORICS, July 20 31, 2009, University of the Philippines Diliman
- Imprimitive cometric association schemes: constructions and analysis
- Differential Power Analysis Side-Channel Attacks in Cryptography
- Project Number: CS-Authentication Schemes based on Physically Unclonable Functions
- William J. Martin, 7 Red Barn Road, Holden, MA 01520 H: (508) 829-9727 W: (508) 831-5316 cell: (774) 345-0000 e-mail: martin@wpi.edu
- Just how resilient are they? William J. Martin and Berk Sunar
- Claude Tardif Non-canonical Independent sets in Graph Powers
- CIMPA Philippines Semidefinite Prog. in Alg. Combin.
- The biweight enumerator and the subconstituent algebra of the n-cube
- A Mathematical and Physical Analysis of Circuit Jitter with Application to Cryptographic Random Bit Generation
- CIMPA Philippines Semidefinite Prog. in Alg. Combin.
- Characterizing completely regular codes from an algebraic viewpoint
- COMMUTATIVE ASSOCIATION SCHEMES WILLIAM J. MARTIN AND HAJIME TANAKA
- There are finitely many Q-polynomial association schemes with given first multiplicity at least three
- Representations of Directed Strongly Regular Chris D. Godsil
- A dual Plotkin bound for (T, M, S)-nets William J. Martin1
- 1 (t,m,s)-Nets William J. Martin
- A physics-free introduction to quantum error correcting codes
- Project Number: MA-WJM-6401 Almost Independent Binary Random Variables
- CIMPA-UNESCO Philippines School on Semidefinite Programming in Algebraic Combinatorics Non-Philippine Participants
- CIMPA Philippines Semidefinite Prog. in Alg. Combin.
- A Graph-Theoretic Approach to Bounds for Error-Correcting Codes1
- (T, M, S)-Nets Resilient Functions
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Association schemes for ordered orthogonal arrays and (t,m,s)nets
- Arithmetic completely regular codes J. H. Koolen,
- Linear programming bounds for (T, M, S)-nets William J. Martin
- On the equivalence between real mutually unbiased bases and a certain class of association schemes
- Project Number: MA-WJM-4801 A Study of Linear Programming Bounds for Spherical Codes
