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. [doi]
@article{BlackmoreN01:0,
title = {Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound},
author = {Tim Blackmore and Graham H. Norton},
year = {2001},
url = {http://epubs.siam.org/sam-bin/dbq/article/37643},
researchr = {https://researchr.org/publication/BlackmoreN01%3A0},
cites = {0},
citedby = {0},
journal = {SIAM J. Discrete Math.},
volume = {15},
number = {1},
pages = {14-40},
}