"Lower Bounds on the State Complexity of Geometric Goppa Codes."

Tim Blackmore, Graham H. Norton (2002)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2019-06-17

- no documents available
- export record
  dblp key:
  - journals/dcc/BlackmoreN02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/BlackmoreN02
Tim Blackmore, Graham H. Norton:
Lower Bounds on the State Complexity of Geometric Goppa Codes. Des. Codes Cryptogr. 25(1): 95-115 (2002)

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.