- Makoto Araya and Masaaki Harada, MDS codes over F9 related to the ternary Golay code, Discrete Math. 282 (2004), no. 1-3, 233–237.[MR]
- Makoto Araya, Masaaki Harada, and Hadi Kharaghani, Some Hadamard matrices of order 32 and their binary codes, J. Combin. Des. 12 (2004), no. 2, 142–146.[MR]
- Christine Bachoc, T. Aaron Gulliver, and Masaaki Harada, Isodual codes over Z2k and isodual lattices, J. Algebraic Combin. 12 (2000), no. 3, 223–240.[MR]
- Eiichi Bannai, Steven T. Dougherty, Masaaki Harada, and Manabu Oura, Type II codes, even unimodular lattices, and invariant rings, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1194–1205.[MR]
- Koichi Betsumiya, T. Aaron Gulliver, and Masaaki Harada, Binary optimal linear rate 1/2 codes, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Honolulu, HI, 1999), Lecture Notes in Comput. Sci., vol. 1719, Springer, Berlin, 1999, pp. 462–471.[MR]
- Koichi Betsumiya, T. Aaron Gulliver, and Masaaki Harada, Extremal self-dual codes over F2×F2, Des. Codes Cryptogr. 28 (2003), no. 2, 171–186.[MR]
- Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada, and Akihiro Munemasa, On type II codes over F4, IEEE Trans. Inform. Theory 47 (2001), no. 6, 2242–2248.[MR]
- Koichi Betsumiya and Masaaki Harada, Binary optimal odd formally self-dual codes, Des. Codes Cryptogr. 23 (2001), no. 1, 11–21.[MR]
- Koichi Betsumiya and Masaaki Harada, Classification of formally self-dual even codes of lengths up to 16, Des. Codes Cryptogr. 23 (2001), no. 3, 325–332.[MR]
- Koichi Betsumiya and Masaaki Harada, Formally self-dual codes related to Type II codes, Appl. Algebra Engrg. Comm. Comput. 14 (2003), no. 2, 81–88.[MR]
- Stefka Bouyuklieva and Masaaki Harada, Extremal self-dual [50, 25, 10] codes with automorphisms of order 3 and quasi-symmetric 2-(49,9,6) designs, Des. Codes Cryptogr. 28 (2003), no. 2, 163–169.[MR]
- Naoki Chigira, Masaaki Harada, and Masaaki Kitazume, Extremal self-dual codes of length 64 through neighbors and covering radii, Des. Codes Cryptogr. 42 (2007), no. 1, 93–101.[MR]
- Naoki Chigira, Masaaki Harada, and Masaaki Kitazume, Permutation groups and binary self-orthogonal codes, J. Algebra 309 (2007), no. 2, 610–621.[MR]
- Naoki Chigira, Masaaki Harada, and Masaaki Kitazume, Some self-dual codes invariant under the Hall-Janko group, J. Algebra 316 (2007), no. 2, 578–590.[MR]
- Radinka Dontcheva and Masaaki Harada, Some extremal self-dual codes with an automorphism of order 7, Appl. Algebra Engrg. Comm. Comput. 14 (2003), no. 2, 75–79.[MR]
- Steven T. Dougherty, Philippe Gaborit, Masaaki Harada, and Patrick Solé, Type II codes over F2+uF2, IEEE Trans. Inform. Theory 45 (1999), no. 1, 32–45.[MR]
- Steven T. Dougherty, Masaaki Harada, and Manabu Oura, Note on the g-fold joint weight enumerators of self-dual codes over Zk, Appl. Algebra Engrg. Comm. Comput. 11 (2001), no. 6, 437–445.[MR]
- Steven T. Dougherty, Masaaki Harada, and Manabu Oura, Note on the biweight enumerators of self-dual codes over Zk, Preprint (2004), 11 pages.
- T. Aaron Gulliver and Masaaki Harada, Classification of extremal double circulant formally self-dual even codes, Des. Codes Cryptogr. 11 (1997), no. 1, 25–35.[MR]
- T. Aaron Gulliver and Masaaki Harada, Classification of extremal double circulant self-dual codes of lengths 64 to 72, Des. Codes Cryptogr. 13 (1998), no. 3, 257–269.[MR]
- T. Aaron Gulliver and Masaaki Harada, Double circulant self-dual codes over Z2k, IEEE Trans. Inform. Theory 44 (1998), no. 7, 3105–3123.[MR]
- T. Aaron Gulliver and Masaaki Harada, Double circulant self-dual codes over GF(5), Ars Combin. 56 (2000), 3–13.[MR]
- T. Aaron Gulliver and Masaaki Harada, Optimal double circulant Z4-codes, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Melbourne, 2001), Lecture Notes in Comput. Sci., vol. 2227, Springer, Berlin, 2001, pp. 122–128.[MR]
- T. Aaron Gulliver and Masaaki Harada, Orthogonal frames in the Leech lattice and a type II code over Z22, J. Combin. Theory Ser. A 95 (2001), no. 1, 185–188.[MR]
- T. Aaron Gulliver and Masaaki Harada, Classification of extremal double circulant self-dual codes of lengths 74–88, Discrete Math. 306 (2006), no. 17, 2064–2072.[MR]
- T. Aaron Gulliver and Masaaki Harada, On double circulant doubly even self-dual [72,36,12] codes and their neighbors, Australas. J. Combin. 40 (2008), 137–144.[MR]
- T. Aaron Gulliver, Masaaki Harada, and Jon-Lark Kim, Construction of new extremal self-dual codes, Discrete Math. 263 (2003), no. 1-3, 81–91.[MR]
- T. Aaron Gulliver, Masaaki Harada, and Jon-Lark Kim, Construction of some extremal self-dual codes, Discrete Math. 264 (2003), 55–73.
- T. Aaron Gulliver, Masaaki Harada, and Hiroki Miyabayashi, Double circulant and quasi-twisted self-dual codes over F5 and F7, Adv. Math. Commun. 1 (2007), no. 2, 223–238.[MR]
- T. Aaron Gulliver, Masaaki Harada, and Hiroki Miyabayashi, Optimal double circulant self-dual codes over F4. II, Australas. J. Combin. 39 (2007), 163–174.[MR]
- T. Aaron Gulliver, Masaaki Harada, Takuji Nishimura, and Patric R. J. Östergård, Near-extremal formally self-dual even codes of lengths 24 and 32, Des. Codes Cryptogr. 37 (2005), no. 3, 465–471.[MR]
- Masaaki Harada, Construction of an extremal self-dual code of length 62, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1232–1233.[MR]
- Masaaki Harada, New extremal self-dual codes of lengths 36 and 38, IEEE Trans. Inform. Theory 45 (1999), no. 7, 2541–2543.[MR]
- Masaaki Harada, On the self-dual F5-codes constructed from Hadamard matrices of order 24, J. Combin. Des. 13 (2005), no. 2, 152–156.[MR]
- Masaaki Harada, Self-orthogonal 3-(56,12,65) designs and extremal doubly-even self-dual codes of length 56, Des. Codes Cryptogr. 38 (2006), no. 1, 5–16.[MR]
- Masaaki Harada, An extremal doubly even self-dual code of length 112, Electron. J. Combin. 15 (2008), no. 1, Note 33, 5.[MR]
- Masaaki Harada, On the existence of frames of the Niemeier lattices and self-dual codes over Fp, J. Algebra 321 (2009), no. 8, 2345–2352.[MR/doi]
- Masaaki Harada, Extremal type II Z4-codes of lengths 56 and 64, J. Combin. Theory Ser. A 117 (2010), no. 8, 1285–1288.[MR/doi]
- Masaaki Harada, W. Holzmann, H. Kharaghani, and M. Khorvash, Extremal ternary self-dual codes constructed from negacirculant matrices, Graphs Combin. 23 (2007), no. 4, 401–417.[MR]
- Masaaki Harada and Hadi Kharaghani, Orthogonal designs and MDS self-dual codes, Australas. J. Combin. 35 (2006), 57–67.[MR]
- Masaaki Harada, Masaaki Kitazume, Akihiro Munemasa, and Boris Venkov, On some self-dual codes and unimodular lattices in dimension 48, European J. Combin. 26 (2005), no. 5, 543–557.[MR]
- Masaaki Harada, Masaaki Kitazume, and Michio Ozeki, Ternary code construction of unimodular lattices and self-dual codes over Z6, J. Algebraic Combin. 16 (2002), no. 2, 209–223.[MR]
- Masaaki Harada, Clement Lam, and Vladimir D. Tonchev, Symmetric (4,4)-nets and generalized Hadamard matrices over groups of order 4, Des. Codes Cryptogr. 34 (2005), no. 1, 71–87.[MR]
- Masaaki Harada and Tsuyoshi Miezaki, An upper bound on the minimum weight of type ii-codes, J Combin. Theory Ser. A 118 (2010), no. 1, 190–196.[doi]
- Masaaki Harada and Akihiro Munemasa, A quasi-symmetric 2-(49,9,6) design, J. Combin. Des. 10 (2002), no. 3, 173–179.[MR]
- Masaaki Harada and Akihiro Munemasa, A complete classification of ternary self-dual codes of length 24, J. Combin. Theory Ser. A 116 (2009), no. 5, 1063–1072.[MR/arXiv]
- Masaaki Harada, Akihiro Munemasa, and Boris Venkov, Classification of ternary extremal self-dual codes of length 28, Math. Comp. 78 (2009), no. 267, 1787–1796.[MR]
- Masaaki Harada and Takuji Nishimura, An extremal singly even self-dual code of length 88, Adv. Math. Commun. 1 (2007), no. 2, 261–267.[MR]
- Masaaki Harada, Takuji Nishimura, and Radinka Yorgova, New extremal self-dual codes of length 66, Math. Balkanica (N.S.) 21 (2007), no. 1-2, 113–121.[MR]
- Masaaki Harada, Michio Ozeki, and Kenichiro Tanabe, On the covering radius of ternary extremal self-dual codes, Des. Codes Cryptogr. 33 (2004), no. 2, 149–158.[MR]
- Masaaki Harada and Vladimir D. Tonchev, Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms, Discrete Math. 264 (2003), no. 1-3, 81–90.[MR]