Search the dblp DataBase

Publications of Author

1. Mike Bartley, Darren Galpin, Tim Blackmore
   A comparison of three verification techniques: directed testing, pseudo-random testing and property checking. [Citation Graph (0, 0)][DBLP]
   DAC, 2002, pp:819-823 [Conf]
   
2. Tim Blackmore, Graham H. Norton
   Matrix-Product Codes over F_q. [Citation Graph (0, 0)][DBLP]
   Appl. Algebra Eng. Commun. Comput., 2001, v:12, n:6, pp:477-500 [Journal]
   
3. Tim Blackmore, Graham H. Norton
   Lower Bounds on the State Complexity of Geometric Goppa Codes. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2002, v:25, n:1, pp:95-115 [Journal]
   
4. Tim Blackmore, Graham H. Norton
   Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2001, v:15, n:1, pp:14-40 [Journal]
   
5. Tim Blackmore
   Every Binary (2^m-2, 2^2m-2-m, 3) Code Can Be Lengthened to Form a Perfect Code of Length 2^m-1. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:698-700 [Journal]
   
6. Tim Blackmore, Graham H. Norton
   On a family of Abelian codes and their state complexities. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:355-361 [Journal]