Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound

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]

Abstract

Abstract is missing.