"Determining When the Absolute State Complexity of a Hermitian Code ..."

Tim Blackmore, Graham H. Norton (2001)

> Home

Details and statistics

DOI: 10.1137/S0895480100376435

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/BlackmoreN01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/BlackmoreN01
Tim Blackmore, Graham H. Norton:
Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound. SIAM J. Discret. Math. 15(1): 14-40 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.