"A class of optimal linear codes of length one above the Griesmer bound."

E. J. Cheon (2009)

> Home

Details and statistics

DOI: 10.1007/S10623-008-9239-X

access: closed

type: Journal Article

metadata version: 2019-06-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dcc/Cheon09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/Cheon09
E. J. Cheon:
A class of optimal linear codes of length one above the Griesmer bound. Des. Codes Cryptogr. 51(1): 9-20 (2009)

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.