Akihiro Munemasa

dblp:59/2641 · DBLP profile ↗
← Back
18ranked-venue papers
5as first author
3since 2021 · last 2024
0000-0002-2635-0733ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 11 · 3 first-author · 3 since 2021Theory of computation · 7 · 2 first-author
YearPublicationVenuePosition
2024 Jacobi polynomials and harmonic weight enumerators of the first-order Reed-Muller codes and the extended Hamming codes
Tsuyoshi Miezaki, Akihiro Munemasa
Des. Codes Cryptogr.2
2024 Classification of extremal type II $\mathbb {Z}_4$-codes of length 24
Akihiro Munemasa, Rowena Alma L. Betty
Des. Codes Cryptogr.1
2021 A note on Assmus-Mattson type theorems
Tsuyoshi Miezaki, Akihiro Munemasa, Hiroyuki Nakasora
Des. Codes Cryptogr.2
2019 Classification of Self-dual Codes of Length 20 over ℤ4 and Length at Most 18 over 𝔽2+u𝔽2
Rowena Alma L. Betty, Akihiro Munemasa
IMACC2
2019 Bent Vectorial Functions, Codes and Designs
abstract
Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group (GF(22m), +), have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective of this paper is to use bent vectorial functions for a construction of a two-parameter family of binary linear codes that do not satisfy the conditions of the Assmus-Mattson theorem, but nevertheless hold 2-designs. A new coding-theoretic characterization of bent vectorial functions is presented.
Cunsheng Ding, Akihiro Munemasa, Vladimir D. Tonchev
IEEE Trans. Inf. Theory2
2017 Godsil-McKay switching and twisted Grassmann graphs
Akihiro Munemasa
Des. Codes Cryptogr.1
2016 A Note on the Brawley-Carlitz Theorem on Irreducibility of Composed Products of Polynomials over Finite Fields
Akihiro Munemasa, Hiroko Nakamura
WAIFI1
2014 Fat Hoffman graphs with smallest eigenvalue greater than -3
Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi
Discret. Appl. Math.1
2012 Nomura algebras of nonsymmetric Hadamard models
Takuya Ikuta, Akihiro Munemasa
Des. Codes Cryptogr.2
2011 Classification of Quaternary Hermitian Self-Dual Codes of Length 20
abstract
A classification of quaternary Hermitian self-dual codes of length 20 is given. Using this classification, a classification of extremal quaternary Hermitian self-dual codes of length 22 is also given.
Masaaki Harada, Akihiro Munemasa
IEEE Trans. Inf. Theory2
2009 Mass Formula for Even Codes over
Koichi Betsumiya, Rowena Alma L. Betty, Akihiro Munemasa
IMACC3
2009 On the Classification of Self-dual -Codes
Masaaki Harada, Akihiro Munemasa
IMACC2
2009 There exists no self-dual [24, 12, 10] code over \mathbb F5{{\mathbb F}_5}
Masaaki Harada, Akihiro Munemasa
Des. Codes Cryptogr.2
2006 Some restrictions on weight enumerators of singly even self-dual codes
abstract
In this correspondence, we give some restrictions on weight enumerators of singly even self-dual [n,n/2,d] codes whose shadows have minimum weight d/2. As a consequence, we determine the weight enumerators for which there is an extremal singly even self-dual [40,20,8] code and an optimal singly even self-dual [50,25,10] code
Masaaki Harada, Akihiro Munemasa
IEEE Trans. Inf. Theory2
2002 A Correction to "Incidence Matrices and Collineations of Finite Projective Planes" by Chat Yin Ho, Designs, Codes and Cryptography, 18 (1999)
D. Brozovic, Chat Yin Ho, Akihiro Munemasa
Des. Codes Cryptogr.3
2001 On type II codes over F4
abstract
Previously, Type II codes over F/sub 4/ have been introduced as Euclidean self-dual codes with the property that all Lee weights are divisible by four. In this paper, a number of properties of Type II codes are presented. We construct several extremal Type II codes and a number of extremal Type I codes. It is also shown that there are seven Type II codes of length 12, up to permutation equivalence.
Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada, Akihiro Munemasa
IEEE Trans. Inf. Theory4
1999 Type IV self-dual codes over rings
abstract
We study Type IV self-dual codes over the commutative rings of order 4. Gleason-type theorems of Type IV codes and their shadow codes are investigated. A mass formula of Type IV codes over these rings are given. We give a classification of Type TV codes over Z/sub 4/ and F2+uF/sub 2/ for reasonable lengths. We also construct a number of optimal Type TV codes.
Steven T. Dougherty, Philippe Gaborit, Masaaki Harada, Akihiro Munemasa, Patrick Solé
IEEE Trans. Inf. Theory4
1995 On Perfect t-Shift Codes in Abelian Groups
Akihiro Munemasa
Des. Codes Cryptogr.1