default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTsuyoshi Miezaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]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)- [j22]Tsuyoshi Miezaki, Akihiro Munemasa:
Jacobi polynomials and harmonic weight enumerators of the first-order Reed-Muller codes and the extended Hamming codes. Des. Codes Cryptogr. 92(4): 1041-1049 (2024) - [j21]Thomas Britz, Himadri Shekhar Chakraborty, Reina Ishikawa, Tsuyoshi Miezaki, Hopein Christofen Tang:
Harmonic Tutte polynomials of matroids II. Des. Codes Cryptogr. 92(5): 1279-1297 (2024) - [j20]Madoka Awada, Tsuyoshi Miezaki, Akihiro Munemasa, Hiroyuki Nakasora:
A note on t-designs in isodual codes. Finite Fields Their Appl. 95: 102366 (2024) - 2023
- [j19]Himadri Shekhar Chakraborty, Tsuyoshi Miezaki, Manabu Oura:
Harmonic Tutte polynomials of matroids. Des. Codes Cryptogr. 91(6): 2223-2236 (2023) - [j18]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) - [j17]Himadri Shekhar Chakraborty, Tsuyoshi Miezaki, Manabu Oura, Yuuho Tanaka:
Jacobi polynomials and design theory I. Discret. Math. 346(6): 113339 (2023) - [j16]Himadri Shekhar Chakraborty, Tsuyoshi Miezaki, Chong Zheng:
Weighted Tutte-Grothendieck Polynomials of Graphs. Graphs Comb. 39(5): 108 (2023) - [i9]Madoka Awada, Tsuyoshi Miezaki, Akihiro Munemasa, Hiroyuki Nakasora:
A note on t-designs in isodual codes. CoRR abs/2309.03206 (2023) - [i8]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) - [i7]Madoka Awada, Reina Ishikawa, Tsuyoshi Miezaki, Yuuho Tanaka:
A criterion for determining whether multiple shells support a t-design. CoRR abs/2310.15856 (2023) - 2022
- [j15]Tsuyoshi Miezaki, Hiroyuki Nakasora:
A note on the Assmus-Mattson theorem for some binary codes. Des. Codes Cryptogr. 90(6): 1485-1502 (2022) - [j14]Himadri Shekhar Chakraborty, Tsuyoshi Miezaki:
Variants of Jacobi polynomials in coding theory. Des. Codes Cryptogr. 90(11): 2583-2597 (2022) - [j13]Himadri Shekhar Chakraborty, Tsuyoshi Miezaki, Manabu Oura:
Weight enumerators, intersection enumerators and Jacobi polynomials II. Discret. Math. 345(12): 113098 (2022) - [i6]Himadri Shekhar Chakraborty, Tsuyoshi Miezaki, Manabu Oura, Yuuho Tanaka:
Jacobi polynomials and design theory I. CoRR abs/2207.10911 (2022) - [i5]Tsuyoshi Miezaki, Hiroyuki Nakasora:
On the Assmus-Mattson type theorem for Type I and even formally self-dual codes. CoRR abs/2208.08617 (2022) - [i4]Eiichi Bannai, Tsuyoshi Miezaki, Hiroyuki Nakasora:
A note on the Assmus-Mattson theorem for some binary codes II. CoRR abs/2208.09077 (2022) - [i3]Thomas Britz, Himadri Shekhar Chakraborty, Reina Ishikawa, Tsuyoshi Miezaki:
Harmonic Tutte polynomials of matroids II. CoRR abs/2210.16490 (2022) - 2021
- [j12]Tsuyoshi Miezaki:
Design-theoretic analogies between codes, lattices, and vertex operator algebras. Des. Codes Cryptogr. 89(5): 763-780 (2021) - [j11]Tsuyoshi Miezaki, Akihiro Munemasa, Hiroyuki Nakasora:
A note on Assmus-Mattson type theorems. Des. Codes Cryptogr. 89(5): 843-858 (2021) - [j10]Himadri Shekhar Chakraborty, Tsuyoshi Miezaki:
Average of complete joint weight enumerators and self-dual codes. Des. Codes Cryptogr. 89(6): 1241-1254 (2021) - [j9]Misaki Kume, Tsuyoshi Miezaki, Tadashi Sakuma, Hidehiro Shinohara:
Tutte Polynomial, Complete Invariant, and Theta Series. Graphs Comb. 37(5): 1545-1558 (2021) - 2020
- [i2]Tsuyoshi Miezaki, Hiroyuki Nakasora:
Strengthening of the Assmus-Mattson theorem for some dual codes. CoRR abs/2004.03396 (2020)
2010 – 2019
- 2019
- [j8]Tsuyoshi Miezaki, Manabu Oura:
On the cycle index and the weight enumerator. Des. Codes Cryptogr. 87(6): 1237-1242 (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) - [j4]Masaaki Harada, Tsuyoshi Miezaki:
On the existence of extremal Type II ℤ2k-codes. Math. Comput. 83(287): 1427-1446 (2014) - 2013
- [j3]Tsuyoshi Miezaki:
On a generalization of spherical designs. Discret. Math. 313(4): 375-380 (2013) - 2012
- [j2]Tsuyoshi Miezaki, Makoto Tagami:
On Euclidean Designs and Potential Energy. Electron. J. Comb. 19(1): 2 (2012) - 2011
- [j1]Masaaki Harada, Tsuyoshi Miezaki:
An upper bound on the minimum weight of Type II Z2k-codes. J. Comb. Theory A 118(1): 190-196 (2011)
2000 – 2009
- 2009
- [i1]Masaaki Harada, Tsuyoshi Miezaki:
An Upper Bound on the Minimum Weight of Type II ZZ2k-Codes. CoRR abs/0906.5023 (2009)
Coauthor Index
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-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
