Masakazu Jimbo

Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions

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 with new parameters are presented, and a number of bounds on sets of frequency hopping sequences are described.

On a composition of cyclic 2-designs

A CB(v,k,@l) means a cyclic 2-design of block size k coincidence number @l, and with v points. In this paper, a recursive construction of a CB(v,k,@l) from two or three cyclic 2-designs is given.

Constant Weight Conflict-Avoiding Codes

A conflict-avoiding code (CAC)

On Conflict-Avoiding Codes of Length

C

n=4m

of length

for Three Active Users

n

An iteration method for calculating the relative capacity

with weight

Recursive constructions for cyclic BIB designs and their generalizations

k

Constructions of balanced incomplete block designs with nested rows and columns

is a family of binary sequences of length

A construction of mutually disjoint Steiner systems from isomorphic Golay codes

n