Tim Blackmore

List of publications from the DBLP Bibliography Server - FAQ

2002

6 EE Mike Bartley, Darren Galpin, Tim Blackmore: A comparison of three verification techniques: directed testing, pseudo-random testing and property checking. DAC 2002: 819-823

5 Tim Blackmore, Graham H. Norton: Lower Bounds on the State Complexity of Geometric Goppa Codes. Des. Codes Cryptography 25(1): 95-115 (2002)

2001

4 EE Tim Blackmore, Graham H. Norton: Matrix-Product Codes over F_q. Appl. Algebra Eng. Commun. Comput. 12(6): 477-500 (2001)

3 Tim Blackmore, Graham H. Norton: On a family of Abelian codes and their state complexities. IEEE Transactions on Information Theory 47(1): 355-361 (2001)

2 EE Tim Blackmore, Graham H. Norton: Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound. SIAM J. Discrete Math. 15(1): 14-40 (2001)

1999

1 Tim Blackmore: Every Binary (2^m-2, 2^{2^m-2-m}, 3) Code Can Be Lengthened to Form a Perfect Code of Length 2^m-1. IEEE Transactions on Information Theory 45(2): 698-700 (1999)

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

Coauthor Index