Tadao Kasami

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with W. Wesley Peterson

> Home > Persons > Tadao Kasami

Publications

1973
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/cacm/PetersonKT73
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/PetersonKT73
W. Wesley Peterson, Tadao Kasami, Nobuki Tokura:
On the Capabilities of While, Repeat, and Exit Statements. Commun. ACM 16(8): 503-512 (1973)
1968
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/KasamiLP68
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/KasamiLP68
Tadao Kasami, Shu Lin, W. Wesley Peterson:
New generalizations of the Reed-Muller codes-I: Primitive codes. IEEE Trans. Inf. Theory 14(2): 189-199 (1968)
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/KasamiLP68a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/KasamiLP68a
Tadao Kasami, Shu Lin, W. Wesley Peterson:
Polynomial codes. IEEE Trans. Inf. Theory 14(6): 807-814 (1968)
1967
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/KasamiLP67
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/KasamiLP67
Tadao Kasami, Shu Lin, W. Wesley Peterson:
Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application. Inf. Control. 11(5/6): 475-496 (1967)

a service of

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.