Tim Blackmore (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

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

4 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 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)

Selection of 4 from 7 records - Tim Blackmore has 7 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

5		Tim Blackmore, Graham H. Norton: Lower Bounds on the State Complexity of Geometric Goppa Codes. Des. Codes Cryptography 25(1): 95-115 (2002)
4		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		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)