#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1973

2019

- This year (1)
- Last 5 years (19)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Cunsheng Ding, Ryoh Fuji-Hara, Yuichiro Fujiwara, Masakazu Jimbo, Miwako Mishima
- IEEE Transactions on Information Theory
- 2009

Frequency hopping spread spectrum and direct sequence spread spectrum are two main spread coding technologies in communication systems. Frequency hopping sequences are needed in frequency hopping… (More)

- Masakazu Jimbo, Kiyonori Kunisawa
- Information and Control
- 1979

An iteration method is given for computing the relative capacity of a discrete memoryless channel, i.e., the maximum of the information transmission rate per cost. The algorithm is simpler and more… (More)

- Masakazu Jimbo, Keisuke Shiromoto
- J. Comb. Theory, Ser. A
- 2009

It is well known that the extended binary Golay [24,12,8] code yields 5-designs. In particular, the supports of all the weight 8 codewords in the code form a Steiner system S(5,8,24). In this paper,… (More)

- Koji Momihara, Meinard Mueller, Junya Satoh, Masakazu Jimbo
- SIAM J. Discrete Math.
- 2007

A conflict-avoiding code (CAC) $C$ of length $n$ with weight $k$ is a family of binary sequences of length $n$ and weight $k$ satisfying $\sum_{0\le t\le n-1}x_{it}x_{j,t+s}\le \lambda$ for any… (More)

- Masakazu Jimbo, Miwako Mishima, Susan Janiszewski, Amin Y. Teymorian, Vladimir D. Tonchev
- IEEE Transactions on Information Theory
- 2007

New improved upper and lower bounds on the maximum size of a symmetric or arbitrary conflict-avoiding code of length n = 4 m for three active users are proved. Furthermore, direct constructions for… (More)

- Meinard Mueller, Masakazu Jimbo
- Discrete Mathematics
- 2004

Abstract Colbourn (Ann. Combin. 3 (1999) 37–41) developed some strategy for nonadaptive group testing when the items are linearly ordered and the positives items form a consecutive subset of all… (More)

- Masakazu Jimbo, Yuta Kunihara, Reinhard Laue, Masanori Sawa
- J. Comb. Theory, Ser. A
- 2011

In this paper we present a construction of 3-designs by using a 3-design with resolvability. The basic construction generalizes a well-known construction of simple 3-(v,4,3) designs by Jungnickel and… (More)

- Masakazu Jimbo, Keisuke Shiromoto
- Information Security, Coding Theory and Related…
- 2011

Quantum jump codes were introduced by Alber et al. (2001). Quantum jump codes have a close connection with combinatorial designs called t-SEED (t-spontaneaus emission error design). In this paper, we… (More)

- Meinard Mueller, Tomoko Adachi, Masakazu Jimbo
- Discrete Applied Mathematics
- 2005

To minimize the access cost in large disk arrays (RAID) Cohen, Colbourn, and Froncek introduced and investigated in a series of papers the concept of (d, f)-cluttered orderings of various set… (More)