Masakazu Jimbo

According to our database1, Masakazu Jimbo authored at least 37 papers between 1979 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Error-Correcting Locating Arrays for Interaction Fault Location in Combinatorial Testing.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
BCH Codes with Minimum Distance Proportional to Code Length.
SIAM J. Discret. Math., 2021

2020
Partitions of the lines in PG(2n-1, s) into multifold spreads for s=3, 4.
Discret. Math., 2020

2019
Multifold factorizations of cyclic groups into subsets.
Finite Fields Their Appl., 2019

Grid-block difference families and related combinatorial structures.
Discret. Math., 2019

2017
Affine-invariant strictly cyclic Steiner quadruple systems.
Des. Codes Cryptogr., 2017

2016
Optimal equi-difference conflict-avoiding codes of weight four.
Des. Codes Cryptogr., 2016

2014
Optimal equi-difference conflict-avoiding codes of odd length and weight three.
Finite Fields Their Appl., 2014

Extremal properties of t-SEEDs and recursive constructions.
Des. Codes Cryptogr., 2014

2012
A decomposition of the 2-design formed by the planes in AG(2n, 3).
Finite Fields Their Appl., 2012

2011
Quantum jump codes and related combinatorial designs.
Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011

Unifying some known infinite families of combinatorial 3-designs.
J. Comb. Theory, Ser. A, 2011

2009
Sets of frequency hopping sequences: bounds and optimal constructions.
IEEE Trans. Inf. Theory, 2009

A Positive Detecting Code and Its Decoding Algorithm for DNA Library Screening.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

A construction of mutually disjoint Steiner systems from isomorphic Golay codes.
J. Comb. Theory, Ser. A, 2009

2008
Cyclic sequences of k-subsets with distinct consecutive unions.
Discret. Math., 2008

Further constructions for BIB designs with nested rows and columns.
Ars Comb., 2008

2007
On Conflict-Avoiding Codes of Length n=4m for Three Active Users.
IEEE Trans. Inf. Theory, 2007

Constant Weight Conflict-Avoiding Codes.
SIAM J. Discret. Math., 2007

Bounds and Constructions for Optimal Constant Weight Conflict-Avoiding Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2005
Cluttered orderings for the complete bipartite graph.
Discret. Appl. Math., 2005

2004
Consecutive positive detectable matrices and group testing for consecutive positives.
Discret. Math., 2004

Erasure-resilient codes from affine spaces.
Discret. Appl. Math., 2004

2003
The Existence of 2x4 Grid-Block Designs and Their Applications.
SIAM J. Discret. Math., 2003

Combinatorial structure of group divisible designs without alpha-resolution classes in each group.
Discret. Math., 2003

2000
Recursive constructions for cyclic quasiframes and cyclically resolvable cyclic Steiner 2-designs.
Discret. Math., 2000

Cyclic resolutions of the BIB design in PG(5, 2).
Australas. J Comb., 2000

1999
Optimum requirement spanning trees and reliability of tree networks.
Networks, 1999

1998
Constructions of nested directed BIB designs.
Australas. J Comb., 1998

1996
A series of identities for the coefficients of inverse matrices on a Hamming scheme.
Discret. Math., 1996

1993
Recursive constructions for cyclic BIB designs and their generalizations.
Discret. Math., 1993

1990
Optimal authentication systems and combinatorial designs.
IEEE Trans. Inf. Theory, 1990

1989
On balanced complementation for regular t-wise balanced designs.
Discret. Math., 1989

1983
Cyclic Neofields and Cyclic Steiner 2-Designs with Block Size 4.
Eur. J. Comb., 1983

On 1-rotational S<sub>lambda</sub>(2, 3, nu) designs.
Discret. Math., 1983

On a composition of cyclic 2-designs.
Discret. Math., 1983

1979
An Iteration Method for Calculating the Relative Capacity
Inf. Control., November, 1979


  Loading...