Gerhard J. M. van Wee

According to our database, Gerhard J. M. van Wee authored at least 10 papers between 1988 and 1993.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1993

Some new lower bounds for binary and ternary covering codes.

Gerhard J. M. van Wee

IEEE Trans. Inf. Theory, 1993

1991

A note on perfect multiple covetings of the Hamming space.

Gerhard J. M. van Wee, Gérard D. Cohen, Simon Litsyn

IEEE Trans. Inf. Theory, 1991

Which linear codes are algebraic-geometric?

Ruud Pellikaan, Ba-Zhong Shen, Gerhard J. M. van Wee

IEEE Trans. Inf. Theory, 1991

Bounds on packings and coverings by spheres in <i>q</i>-ary and mixed Hamming spaces.

Gerhard J. M. van Wee

J. Comb. Theory A, 1991

Generalized bounds on binary/ternary mixed packing and covering codes.

J. H. van Lint Jr., Gerhard J. M. van Wee

J. Comb. Theory A, 1991

On the non-existence of certain perfect mixed codes.

Gerhard J. M. van Wee

Discret. Math., 1991

1990

Binary coveting codes are normal.

Gerhard J. M. van Wee

IEEE Trans. Inf. Theory, 1990

Correction to 'On normal and subnormal q-ary codes' (Nov 89 1291-1295).

Antoine Lobstein, Gerhard J. M. van Wee

IEEE Trans. Inf. Theory, 1990

1989

On normal and subnormal q-ary codes.

Antoine Lobstein, Gerhard J. M. van Wee

IEEE Trans. Inf. Theory, 1989

1988

Improved sphere bounds on the coveting radius of codes.

Gerhard J. M. van Wee

IEEE Trans. Inf. Theory, 1988