default search action
Masakazu Jimbo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c3]Hiroyasu Matsushima
, Yusuke Tajima, Xiao-Nan Lu
Efficient Pooling Designs and Screening Performance in Group Testing for Two Types of Defectives. COMPSAC 2024: 1996-2000 - [i1]Hiroyasu Matsushima, Yusuke Tajima, Xiao-Nan Lu, Masakazu Jimbo:
Efficient pooling designs and screening performance in group testing for two type defectives. CoRR abs/2405.09455 (2024) - 2022
- [c2]Xiao-Nan Lu
Error-Correcting Locating Arrays for Interaction Fault Location in Combinatorial Testing. ISIT 2022: 1094-1099 - 2021
- [j34]Satoshi Noguchi, Xiao-Nan Lu
BCH Codes with Minimum Distance Proportional to Code Length. SIAM J. Discret. Math. 35(1): 179-193 (2021) - 2020
- [j33]Miwako Mishima, Nobuko Miyamoto, Masakazu Jimbo:
Partitions of the lines in PG(2n-1, s) into multifold spreads for s=3, 4. Discret. Math. 343(7): 111867 (2020)
2010 – 2019
- 2019
- [j32]Xiao-Nan Lu
Grid-block difference families and related combinatorial structures. Discret. Math. 342(7): 2023-2032 (2019) - [j31]Kohei Yamada, Miwako Mishima, Junya Satoh, Masakazu Jimbo:
Multifold factorizations of cyclic groups into subsets. Finite Fields Their Appl. 56: 131-149 (2019) - 2017
- [j30]Xiao-Nan Lu
Affine-invariant strictly cyclic Steiner quadruple systems. Des. Codes Cryptogr. 83(1): 33-69 (2017) - 2016
- [j29]Yiling Lin, Miwako Mishima, Masakazu Jimbo:
Optimal equi-difference conflict-avoiding codes of weight four. Des. Codes Cryptogr. 78(3): 747-776 (2016) - 2014
- [j28]Yiling Lin, Masakazu Jimbo:
Extremal properties of t-SEEDs and recursive constructions. Des. Codes Cryptogr. 73(3): 805-823 (2014) - [j27]Yiling Lin, Miwako Mishima, Junya Satoh, Masakazu Jimbo:
Optimal equi-difference conflict-avoiding codes of odd length and weight three. Finite Fields Their Appl. 26: 49-68 (2014) - 2012
- [j26]Koji Momihara, Miwako Mishima, Masakazu Jimbo:
A decomposition of the 2-design formed by the planes in AG(2n, 3). Finite Fields Their Appl. 18(5): 956-970 (2012) - 2011
- [j25]Masakazu Jimbo, Yuta Kunihara, Reinhard Laue, Masanori Sawa:
Unifying some known infinite families of combinatorial 3-designs. J. Comb. Theory A 118(3): 1072-1085 (2011) - [p1]Masakazu Jimbo, Keisuke Shiromoto:
Quantum jump codes and related combinatorial designs. Information Security, Coding Theory and Related Combinatorics 2011: 285-311
2000 – 2009
- 2009
- [j24]Masakazu Jimbo, Keisuke Shiromoto:
A construction of mutually disjoint Steiner systems from isomorphic Golay codes. J. Comb. Theory A 116(7): 1245-1251 (2009) - [j23]Hiroaki Uehara, Masakazu Jimbo:
A Positive Detecting Code and Its Decoding Algorithm for DNA Library Screening. IEEE ACM Trans. Comput. Biol. Bioinform. 6(4): 652-666 (2009) - [j22]Cunsheng Ding
Sets of frequency hopping sequences: bounds and optimal constructions. IEEE Trans. Inf. Theory 55(7): 3297-3304 (2009) - 2008
- [j21]Takaaki Hishida, Masakazu Jimbo, Miwako Mishima, Yukiyasu Mutoh, Kazuhiro Ozawa:
Further constructions for BIB designs with nested rows and columns. Ars Comb. 86 (2008) - [j20]Meinard Müller
Cyclic sequences of k-subsets with distinct consecutive unions. Discret. Math. 308(2-3): 457-464 (2008) - 2007
- [j19]Koji Momihara, Meinard Müller
Constant Weight Conflict-Avoiding Codes. SIAM J. Discret. Math. 21(4): 959-979 (2007) - [j18]Masakazu Jimbo, Miwako Mishima, Susan Janiszewski, Amin Y. Teymorian, Vladimir D. Tonchev
On Conflict-Avoiding Codes of Length n=4m for Three Active Users. IEEE Trans. Inf. Theory 53(8): 2732-2742 (2007) - [c1]Koji Momihara, Meinard Müller
Bounds and Constructions for Optimal Constant Weight Conflict-Avoiding Codes. ISIT 2007: 336-340 - 2005
- [j17]Meinard Müller
Cluttered orderings for the complete bipartite graph. Discret. Appl. Math. 152(1-3): 213-228 (2005) - 2004
- [j16]Meinard Müller
Erasure-resilient codes from affine spaces. Discret. Appl. Math. 143(1-3): 292-297 (2004) - [j15]Meinard Müller
Consecutive positive detectable matrices and group testing for consecutive positives. Discret. Math. 279(1-3): 369-381 (2004) - 2003
- [j14]Tomoko Adachi, Masakazu Jimbo, Sanpei Kageyama:
Combinatorial structure of group divisible designs without alpha-resolution classes in each group. Discret. Math. 265(1-3): 1-11 (2003) - [j13]Yukiyasu Mutoh, Toshio Morihara, Masakazu Jimbo, Hung-Lin Fu:
The Existence of 2x4 Grid-Block Designs and Their Applications. SIAM J. Discret. Math. 16(2): 173-178 (2003) - 2000
- [j12]Takaaki Hishida, Masakazu Jimbo:
Cyclic resolutions of the BIB design in PG(5, 2). Australas. J Comb. 22: 73-80 (2000) - [j11]Miwako Mishima, Masakazu Jimbo:
Recursive constructions for cyclic quasiframes and cyclically resolvable cyclic Steiner 2-designs. Discret. Math. 211: 135-152 (2000)
1990 – 1999
- 1999
- [j10]Tsutomu Anazawa, Takayuki Kodera, Masakazu Jimbo:
Optimum requirement spanning trees and reliability of tree networks. Networks 34(2): 122-131 (1999) - 1998
- [j9]Miwako Mishima, Ying Miao, Sanpei Kageyama, Masakazu Jimbo:
Constructions of nested directed BIB designs. Australas. J Comb. 18: 157-172 (1998) - 1996
- [j8]Miwako Mishima, Masakazu Jimbo:
A series of identities for the coefficients of inverse matrices on a Hamming scheme. Discret. Math. 156(1-3): 285-290 (1996) - 1993
- [j7]Masakazu Jimbo:
Recursive constructions for cyclic BIB designs and their generalizations. Discret. Math. 116(1-3): 79-95 (1993) - 1990
- [j6]Masakazu Jimbo, Ryoh Fuji-Hara:
Optimal authentication systems and combinatorial designs. IEEE Trans. Inf. Theory 36(1): 54-62 (1990)
1980 – 1989
- 1989
- [j5]Ryoh Fuji-Hara, Shinya Kuriki, Masakazu Jimbo:
On balanced complementation for regular t-wise balanced designs. Discret. Math. 76(1): 29-35 (1989) - 1983
- [j4]Shinji Kuriki, Masakazu Jimbo:
On 1-rotational Slambda(2, 3, nu) designs. Discret. Math. 46(1): 33-40 (1983) - [j3]Masakazu Jimbo, Shinji Kuriki:
On a composition of cyclic 2-designs. Discret. Math. 46(3): 249-255 (1983) - [j2]Masakazu Jimbo:
Cyclic Neofields and Cyclic Steiner 2-Designs with Block Size 4. Eur. J. Comb. 4(3): 247-254 (1983)
1970 – 1979
- 1979
- [j1]Masakazu Jimbo, Kiyonori Kunisawa:
An Iteration Method for Calculating the Relative Capacity. Inf. Control. 43(2): 216-223 (1979)
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-09-10 02:10 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: