Tatsuya Maruta

dblp:43/6714 · DBLP profile ↗
← Back
16ranked-venue papers
6as first author
2since 2021 · last 2025
0000-0001-7858-0787ORCID · corroborated

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

Security and privacy · 15 · 6 first-author · 2 since 2021Theory of computation · 1
YearPublicationVenuePosition
2025 A conjecture on the minimum length of linear codes over finite fields
Daiki Kawabata, Tatsuya Maruta, Keita Yasufuku
Des. Codes Cryptogr.2
2022 On the nonexistence of ternary linear codes attaining the Griesmer bound
Daiki Kawabata, Tatsuya Maruta
Des. Codes Cryptogr.2
2018 On critical exponents of Dowling matroids
Yoshitaka Koga, Tatsuya Maruta, Keisuke Shiromoto
Des. Codes Cryptogr.2
2016 On the geometric constructions of optimal linear codes
Yuuki Kageyama, Tatsuya Maruta
Des. Codes Cryptogr.2
2015 On the construction of Griesmer codes of dimension 5
Yuuki Kageyama, Tatsuya Maruta
Des. Codes Cryptogr.2
2013 Three families of multiple blocking sets in Desarguesian projective planes of even order
Anton Betten, E. J. Cheon, Seon Jeong Kim, Tatsuya Maruta
Des. Codes Cryptogr.4
2013 On the minimum length of ternary linear codes
Tatsuya Maruta, Yusuke Oya
Des. Codes Cryptogr.1
2012 A generalized extension theorem for linear codes
Tatsuya Maruta, Yuri Yoshida
Des. Codes Cryptogr.1
2009 A new extension theorem for 3-weight modulo q linear codes over Fq
E. J. Cheon, Tatsuya Maruta
Des. Codes Cryptogr.2
2007 On the minimum length of some linear codes
E. J. Cheon, Tatsuya Maruta
Des. Codes Cryptogr.2
2005 Extendability of Ternary Linear Codes
Tatsuya Maruta
Des. Codes Cryptogr.1
2005 On the Minimum Size of Some Minihypers and Related Linear Codes
Tatsuya Maruta, Ivan N. Landjev, Assya Rousseva
Des. Codes Cryptogr.1
2003 On Optimal Codes Over the Field with Five Elements
Ivan N. Landjev, Assya Rousseva, Tatsuya Maruta, Ray Hill
Des. Codes Cryptogr.3
2001 On the Nonexistence of q-ary Linear Codes of Dimension Five
Tatsuya Maruta
Des. Codes Cryptogr.1
1997 On the Achievement of the Griesmer Bound
Tatsuya Maruta
Des. Codes Cryptogr.1
1997 Optimal linear codes of dimension 4 over F5
abstract
Let n/sub q/(k,d) be the smallest integer n for which there exists a linear code of length n, dimension k, and minimum distance d, over a field of q elements. In this correspondence we determine n/sub 5/(4,d) for all but 22 values of d.
Iliya Bouyukliev, Stoyan N. Kapralov, Tatsuya Maruta, Masaharu Fukui
IEEE Trans. Inf. Theory3