Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Toshimitsu Konno

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 Ryutaroh Matsumoto

> Home > Persons > Toshimitsu Konno

Publications

2006
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/MatsumotoKIKU06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/MatsumotoKIKU06
Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography. IEEE Trans. Inf. Theory 52(9): 4251-4256 (2006)
2005
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-cs-0506087
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-cs-0506087
Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-dual distance bounds of linear codes with application to cryptography. CoRR abs/cs/0506087 (2005)
[i1]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/MatsumotoKIKU05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/MatsumotoKIKU05
Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography. IACR Cryptol. ePrint Arch. 2005: 194 (2005)

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.