![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Hiroyuki Nakasora
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Tsuyoshi Miezaki, Hiroyuki Nakasora:
On the support t-designs of extremal Type III and IV codes. Appl. Algebra Eng. Commun. Comput. 35(5): 591-613 (2024) - [j11]Madoka Awada, Tsuyoshi Miezaki
, Akihiro Munemasa
, Hiroyuki Nakasora
:
A note on t-designs in isodual codes. Finite Fields Their Appl. 95: 102366 (2024) - 2023
- [j10]Eiichi Bannai, Tsuyoshi Miezaki
, Hiroyuki Nakasora
:
A note on the Assmus-Mattson theorem for some binary codes II. Des. Codes Cryptogr. 91(7): 2509-2522 (2023) - [i5]Madoka Awada, Tsuyoshi Miezaki, Akihiro Munemasa, Hiroyuki Nakasora:
A note on t-designs in isodual codes. CoRR abs/2309.03206 (2023) - [i4]Eiichi Bannai, Tsuyoshi Miezaki, Hiroyuki Nakasora:
A note on the Assmus-Mattson theorem for some non-binary codes (a resume). CoRR abs/2309.08081 (2023) - 2022
- [j9]Tsuyoshi Miezaki, Hiroyuki Nakasora
:
A note on the Assmus-Mattson theorem for some binary codes. Des. Codes Cryptogr. 90(6): 1485-1502 (2022) - [i3]Tsuyoshi Miezaki, Hiroyuki Nakasora:
On the Assmus-Mattson type theorem for Type I and even formally self-dual codes. CoRR abs/2208.08617 (2022) - [i2]Eiichi Bannai, Tsuyoshi Miezaki, Hiroyuki Nakasora:
A note on the Assmus-Mattson theorem for some binary codes II. CoRR abs/2208.09077 (2022) - 2021
- [j8]Tsuyoshi Miezaki
, Akihiro Munemasa, Hiroyuki Nakasora
:
A note on Assmus-Mattson type theorems. Des. Codes Cryptogr. 89(5): 843-858 (2021) - 2020
- [i1]Tsuyoshi Miezaki, Hiroyuki Nakasora:
Strengthening of the Assmus-Mattson theorem for some dual codes. CoRR abs/2004.03396 (2020)
2010 – 2019
- 2016
- [j7]Tsuyoshi Miezaki, Hiroyuki Nakasora
:
An upper bound of the value of t of the support t-designs of extremal binary doubly even self-dual codes. Des. Codes Cryptogr. 79(1): 37-46 (2016) - 2014
- [j6]Naoyuki Horiguchi, Tsuyoshi Miezaki, Hiroyuki Nakasora
:
On the support designs of extremal binary doubly even self-dual codes. Des. Codes Cryptogr. 72(3): 529-537 (2014) - [j5]Naoyuki Horiguchi, Tsuyoshi Miezaki, Hiroyuki Nakasora
:
Erratum to: On the support designs of extremal binary doubly even self-dual codes. Des. Codes Cryptogr. 73(3): 1027-1028 (2014) - 2010
- [j4]Hiroyuki Nakasora
:
A construction of 2-designs from Steiner systems and extendable designs. J. Comb. Theory A 117(8): 1289-1294 (2010)
2000 – 2009
- 2009
- [j3]Andries E. Brouwer, Naoyuki Horiguchi, Masaaki Kitazume, Hiroyuki Nakasora
:
A construction of the sporadic Suzuki graph from U3(4). J. Comb. Theory A 116(5): 1056-1062 (2009) - 2008
- [j2]Naoyuki Horiguchi, Masaaki Kitazume, Hiroyuki Nakasora
:
The Hall-Janko graph and the Witt system W10. Eur. J. Comb. 29(1): 1-8 (2008) - 2006
- [j1]Hiroyuki Nakasora
:
A construction of non self-orthogonal designs. Discret. Math. 306(1): 147-152 (2006)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint