default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkihiro Munemasa
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j55]Akihiro Munemasa, Rowena Alma L. Betty
:
Classification of extremal type II $\mathbb {Z}_4$-codes of length 24. Des. Codes Cryptogr. 92(3): 771-785 (2024)- [j54]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) - [j53]Madoka Awada, Tsuyoshi Miezaki, Akihiro Munemasa, Hiroyuki Nakasora:
A note on t-designs in isodual codes. Finite Fields Their Appl. 95: 102366 (2024) - 2023
- [i8]Madoka Awada, Tsuyoshi Miezaki, Akihiro Munemasa, Hiroyuki Nakasora:
A note on t-designs in isodual codes. CoRR abs/2309.03206 (2023) - 2022
- [j52]Akihiro Munemasa, Vladimir D. Tonchev:
Quasi-symmetric 2-(41, 9, 9) designs and doubly even self-dual codes of length 40. Appl. Algebra Eng. Commun. Comput. 33(6): 855-866 (2022) - 2021
- [j51]Tsuyoshi Miezaki, Akihiro Munemasa, Hiroyuki Nakasora:
A note on Assmus-Mattson type theorems. Des. Codes Cryptogr. 89(5): 843-858 (2021) - [j50]Jack H. Koolen, Akihiro Munemasa, Atsuhiro Nakamoto, Katsuhiro Ota, Akira Saito:
Preface to the special issue dedicated to Professors Eiichi Bannai and Hikoe Enomoto on their 75th birthdays. Graphs Comb. 37(5): 1465-1466 (2021) - [j49]Mengyue Cao, Jack H. Koolen, Akihiro Munemasa, Kiyoto Yoshino:
Maximality of Seidel matrices and switching roots of graphs. Graphs Comb. 37(5): 1491-1507 (2021) - [j48]Alexander L. Gavrilyuk, Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Signed analogue of line graphs and their smallest eigenvalues. J. Graph Theory 98(2): 309-325 (2021)
2010 – 2019
- 2019
- [j47]Takuya Ikuta, Akihiro Munemasa:
Complex Hadamard Matrices Attached to a 3-Class Nonsymmetric Association Scheme. Graphs Comb. 35(6): 1293-1304 (2019) - [j46]Cunsheng Ding, Akihiro Munemasa, Vladimir D. Tonchev:
Bent Vectorial Functions, Codes and Designs. IEEE Trans. Inf. Theory 65(11): 7533-7541 (2019) - [c5]Rowena Alma L. Betty, Akihiro Munemasa:
Classification of Self-dual Codes of Length 20 over ℤ4 and Length at Most 18 over 𝔽2+u𝔽2. IMACC 2019: 64-77 - 2018
- [j45]Stefka Bouyuklieva, Masaaki Harada, Akihiro Munemasa:
Nonexistence of Certain Singly Even Self-Dual Codes with Minimal Shadow. Electron. J. Comb. 25(1): 1 (2018) - 2017
- [j44]Akihiro Munemasa:
Godsil-McKay switching and twisted Grassmann graphs. Des. Codes Cryptogr. 84(1-2): 173-179 (2017) - [j43]Masaaki Harada, Akihiro Munemasa:
On s-extremal singly even self-dual [24k + 8, 12k + 4, 4k + 2] codes. Finite Fields Their Appl. 48: 306-317 (2017) - [j42]Gary R. W. Greaves, Akihiro Munemasa, Anni Peng:
On a Lower Bound for the Laplacian Eigenvalues of a Graph. Graphs Comb. 33(6): 1509-1519 (2017) - [i7]Masaaki Harada, Akihiro Munemasa:
Some restrictions on weight enumerators of singly even self-dual codes II. CoRR abs/1706.03429 (2017) - 2016
- [j41]Masaaki Harada, Akihiro Munemasa:
On the classification of self-dual [20, 10, 9] codes over GF(7). Finite Fields Their Appl. 42: 57-66 (2016) - [j40]Gary R. W. Greaves, Jacobus H. Koolen, Akihiro Munemasa, Ferenc Szöllösi:
Equiangular lines in Euclidean spaces. J. Comb. Theory A 138: 208-235 (2016) - [c4]Akihiro Munemasa, Hiroko Nakamura:
A Note on the Brawley-Carlitz Theorem on Irreducibility of Composed Products of Polynomials over Finite Fields. WAIFI 2016: 84-92 - 2015
- [j39]Gary R. W. Greaves, Jack H. Koolen, Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Edge-signed graphs with smallest eigenvalue greater than -2. J. Comb. Theory B 110: 90-111 (2015) - 2014
- [j38]Hye Jin Jang, Jack H. Koolen, Akihiro Munemasa, Tetsuji Taniguchi:
On fat Hoffman graphs with smallest eigenvalue at least -3. Ars Math. Contemp. 7(1): 105-121 (2014) - [j37]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue at least -1 - τ. Ars Math. Contemp. 7(1): 247-262 (2014) - [j36]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue greater than -3. Discret. Appl. Math. 176: 78-88 (2014) - [i6]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
On the smallest eigenvalues of the line graphs of some trees. CoRR abs/1405.3475 (2014) - 2012
- [j35]Masaaki Harada, Akihiro Munemasa:
Classification of self-dual codes of length 36. Adv. Math. Commun. 6(2): 229-235 (2012) - [j34]Koichi Betsumiya, Masaaki Harada, Akihiro Munemasa:
A Complete Classification of Doubly Even Self-dual Codes of Length 40. Electron. J. Comb. 19(3): 18 (2012) - [j33]Takuya Ikuta, Akihiro Munemasa:
Nomura algebras of nonsymmetric Hadamard models. Des. Codes Cryptogr. 65(1-2): 99-106 (2012) - [j32]Akihiro Munemasa, Hiroki Tamura:
The codes and the lattices of Hadamard matrices. Eur. J. Comb. 33(4): 519-533 (2012) - [j31]Koichi Betsumiya, Akihiro Munemasa:
On triply even binary codes. J. Lond. Math. Soc. 86(1): 1-16 (2012) - [i5]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue greater than -3. CoRR abs/1211.3929 (2012) - 2011
- [j30]Masaaki Harada, Akihiro Munemasa:
Classification of Quaternary Hermitian Self-Dual Codes of Length 20. IEEE Trans. Inf. Theory 57(6): 3758-3762 (2011) - [i4]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue at least $-1-τ$. CoRR abs/1111.7284 (2011) - 2010
- [j29]Masaaki Harada, Clement W. H. Lam, Akihiro Munemasa, Vladimir D. Tonchev:
Classification of Generalized Hadamard Matrices H(6,3) and Quaternary Hermitian Self-Dual Codes of Length 18. Electron. J. Comb. 17(1) (2010) - [j28]Aleksandar Jurisic, Akihiro Munemasa, Yuki Tagami:
On graphs with complete multipartite µ-graphs. Discret. Math. 310(12): 1812-1819 (2010) - [j27]Takuya Ikuta, Akihiro Munemasa:
Pseudocyclic association schemes and strongly regular graphs. Eur. J. Comb. 31(6): 1513-1519 (2010) - [i3]Masaaki Harada, Akihiro Munemasa:
Classification of quaternary Hermitian self-dual codes of length 20. CoRR abs/1012.0898 (2010) - [i2]Masaaki Harada, Akihiro Munemasa:
Classification of self-dual codes of length 36. CoRR abs/1012.5464 (2010)
2000 – 2009
- 2009
- [j26]Masaaki Harada, Akihiro Munemasa:
There exists no self-dual [24, 12, 10] code over \mathbb F5{{\mathbb F}_5}. Des. Codes Cryptogr. 52(1): 125-127 (2009) - [j25]Tatsuro Ito, Alexandre A. Ivanov, Akihiro Munemasa:
Preface. Eur. J. Comb. 30(3): 623-624 (2009) - [j24]Masaaki Harada, Akihiro Munemasa:
A complete classification of ternary self-dual codes of length 24. J. Comb. Theory A 116(5): 1063-1072 (2009) - [j23]Masaaki Harada, Akihiro Munemasa, Boris Venkov:
Classification of ternary extremal self-dual codes of length 28. Math. Comput. 78(267): 1787-1796 (2009) - [c3]Koichi Betsumiya, Rowena Alma L. Betty, Akihiro Munemasa:
Mass Formula for Even Codes over. IMACC 2009: 65-77 - [c2]Masaaki Harada, Akihiro Munemasa:
On the Classification of Self-dual -Codes. IMACC 2009: 78-90 - 2008
- [j22]Akihiro Munemasa, Takuya Ikuta:
A new example of non-amorphous association schemes. Contributions Discret. Math. 3(2) (2008) - [j21]Stefka Bouyuklieva, Masaaki Harada, Akihiro Munemasa:
Determination of weight enumerators of binary extremal self-dual [42, 21, 8] codes. Finite Fields Their Appl. 14(1): 177-187 (2008) - [i1]Masaaki Harada, Akihiro Munemasa:
There exists no self-dual [24,12,10] code over F5. CoRR abs/0809.0733 (2008) - 2007
- [j20]Masaaki Harada, Akihiro Munemasa:
On the covering radii of extremal doubly even self-dual codes. Adv. Math. Commun. 1(2): 251-256 (2007) - [j19]Akihiro Munemasa, Masanori Sawa:
Simple abelian quadruple systems. J. Comb. Theory A 114(6): 1160-1164 (2007) - 2006
- [j18]Ryoh Fuji-Hara, Akihiro Munemasa, Vladimir D. Tonchev:
Hyperplane partitions and difference systems of sets. J. Comb. Theory A 113(8): 1689-1698 (2006) - [j17]Masaaki Harada, Akihiro Munemasa:
Some restrictions on weight enumerators of singly even self-dual codes. IEEE Trans. Inf. Theory 52(3): 1266-1269 (2006) - 2005
- [j16]Masaaki Harada, Masaaki Kitazume, Akihiro Munemasa, Boris Venkov:
On some self-dual codes and unimodular lattices in dimension 48. Eur. J. Comb. 26(5): 543-557 (2005) - 2004
- [j15]Akihiro Munemasa, Vladimir D. Tonchev:
A new quasi-symmetric 2-(56, 16, 6) design obtained from codes. Discret. Math. 284(1-3): 231-234 (2004) - [j14]Akihiro Munemasa:
Spherical 5-designs obtained from finite unitary groups. Eur. J. Comb. 25(2): 261-267 (2004) - [j13]Akihiro Munemasa, Gabriele Nebe, Patrick Solé:
Arithme'tique et Combinatoire. Eur. J. Comb. 25(4): 457- (2004) - [j12]Masaaki Harada, Akihiro Munemasa, Kenichiro Tanabe:
Extremal self-dual [40, 20, 8] codes with covering radius 7. Finite Fields Their Appl. 10(2): 183-197 (2004) - [j11]Masaaki Harada, Masaaki Kitazume, Akihiro Munemasa:
On a 5-design related to an extremal doubly even self-dual code of length 72. J. Comb. Theory A 107(1): 143-146 (2004) - 2003
- [j10]Eiichi Bannai, Akihiro Munemasa, Sung-Yell Song, Paul M. Terwilliger:
Preface. Discret. Math. 264(1-3): 1 (2003) - 2002
- [j9]D. Brozovic, Chat Yin Ho, Akihiro Munemasa:
A Correction to "Incidence Matrices and Collineations of Finite Projective Planes" by Chat Yin Ho, Designs, Codes and Cryptography, 18 (1999). Des. Codes Cryptogr. 25(1): 91-93 (2002) - 2001
- [j8]Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada, Akihiro Munemasa:
On type II codes over F4. IEEE Trans. Inf. Theory 47(6): 2242-2248 (2001) - [c1]Koichi Betsumiya, Masaaki Harada, Akihiro Munemasa:
Type II Codes over F2r. AAECC 2001: 102-111
1990 – 1999
- 1999
- [j7]Steven T. Dougherty, Philippe Gaborit, Masaaki Harada, Akihiro Munemasa, Patrick Solé:
Type IV self-dual codes over rings. IEEE Trans. Inf. Theory 45(7): 2345-2360 (1999) - 1995
- [j6]Akihiro Munemasa:
On Perfect t-Shift Codes in Abelian Groups. Des. Codes Cryptogr. 5(3): 253-259 (1995) - 1991
- [j5]Takuya Ikuta, Tatsuro Ito, Akihiro Munemasa:
On Pseudo-automorphisms and Fusions of an Association Scheme. Eur. J. Comb. 12(4): 317-325 (1991) - [j4]Tatsuro Ito, Akihiro Munemasa, Mieko Yamada:
Amorphous Association Schemes over the Galois Rings of Characteristic 4. Eur. J. Comb. 12(6): 513-526 (1991) - [j3]Akihiro Munemasa:
On nonsymmetric P- and Q-polynomial association schemes. J. Comb. Theory B 51(2): 314-328 (1991) - [j2]Akihiro Munemasa:
Splitting fields of association schemes. J. Comb. Theory A 57(1): 157-161 (1991)
1980 – 1989
- 1986
- [j1]Akihiro Munemasa:
An analogue oft-Designs in the association schemes of alternating bilinear forms. Graphs Comb. 2(1): 259-267 (1986)
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 2025-01-09 01:11 CET 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:
