#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1996

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ryoh Fuji-Hara, Ying Miao, Miwako Mishima
- IEEE Transactions on Information Theory
- 2004

Frequency hopping multiple access (FHMA) spread-spectrum communication systems employing multiple frequency-shift keying (MFSK) as data modulation technique are investigated from a combinatorial approach. A correspondence between optimal frequency hopping (FH) sequences and partition-type difference packings is first established. By virtue of this… (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 code-division multiple-access (FH-CDMA) systems. In this paper, four algebraic and a combinatorial constructions of optimal sets of frequency hopping sequences… (More)

- Miwako Mishima, Hung-Lin Fu, Shoichi Uruno
- Des. Codes Cryptography
- 2009

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

- Hung-Lin Fu, Y.-H. Lin, Miwako Mishima
- IEEE Transactions on Information Theory
- 2010

Direct constructions for optimal conflict-avoiding codes of length <formula formulatype="inline"><tex Notation="TeX">$n \equiv 4 \pmod{8}$</tex></formula> and weight 3 are provided by bringing in a new concept called an extended odd sequence. Constructions for those odd sequences are also given in this paper. As a consequence, with previously known results,… (More)

- Yiling Lin, Miwako Mishima, Junya Satoh, Masakazu Jimbo
- Finite Fields and Their Applications
- 2014

- Miwako MISHIMA, Ying MIAO
- 2003

A directed BIB design DB(k, A; v) is a BIB design B(k, 2A; v) in which the blocks are transitively ordered k-tuples and each ordered pair of elements occurs in exactly A blocks. A nested directed BIB design NDB(k, A; v) of form IT 2 <n<k-l(njn, An)i n is a DB(k, A; v) where each block contains E2<n<k-l injn mutually disjoint subblocks, injn subblocks of… (More)

- M. Jimbo, M. Mishima, S. Janiszewski, A.Y. Teymorian, V.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 optimal conflict-avoiding codes of length n = 4 m and m equiv 2 (mod 4) for three active users are provided.

- Miwako Mishima
- Discrete Mathematics
- 2008

- Yiling Lin, Miwako Mishima, Masakazu Jimbo
- Des. Codes Cryptography
- 2016