Juriaan Simonis

According to our database1, Juriaan Simonis authored at least 23 papers between 1987 and 2003.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2003
Some New Results on Optimal Codes Over F<sup>5</sup>.
Des. Codes Cryptogr., 2003

2002
Some new results for optimal ternary linear codes.
IEEE Trans. Inf. Theory, 2002

Restrictions on the weight distribution of quaternary linear codes.
Electron. Notes Discret. Math., 2002

2001
Polynomial invariants for binary linear codes.
Electron. Notes Discret. Math., 2001

The degree of functions and weights in linear codes.
Discret. Appl. Math., 2001

2000
Adding a parity-check bit.
IEEE Trans. Inf. Theory, 2000

The [23, 14, 5] Wagner code is unique.
Discret. Math., 2000

Optimal Subcodes of Second Order Reed-Muller Codes and Maximal Linear Spaces of Bivectors of Maximal Rank.
Des. Codes Cryptogr., 2000

1999
New binary linear codes which are dual transforms of good codes.
IEEE Trans. Inf. Theory, 1999

Some new results on the minimum length of binary linear codes of dimension nine.
IEEE Trans. Inf. Theory, 1999

1998
Metrics Generated by Families of Subspaces.
IEEE Trans. Inf. Theory, 1998

Almost Affine Codes.
Des. Codes Cryptogr., 1998

Codes and Projective Multisets.
Electron. J. Comb., 1998

1997
F-partitions of Cyclic Groups.
Appl. Algebra Eng. Commun. Comput., 1997

1994
Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes.
IEEE Trans. Inf. Theory, 1994

The Effective Length of Subcodes.
Appl. Algebra Eng. Commun. Comput., 1994

1992
On generator matrices of codes.
IEEE Trans. Inf. Theory, 1992

The [18, 9, 6] code is unique.
Discret. Math., 1992

1991
A Simple Proof of the Delsarte Inequalities.
Des. Codes Cryptogr., 1991

1990
A Description of the [16, 7, 6] Codes.
Proceedings of the Applied Algebra, 1990

1988
The minimal covering radius t[15, 6] of a six-dimensional binary linear code of length 15 is equal to 4.
IEEE Trans. Inf. Theory, 1988

Covering Radius: Improving on the Sphere-Covering Bound.
Proceedings of the Applied Algebra, 1988

1987
Binary even [25, 15, 6] codes do not exist.
IEEE Trans. Inf. Theory, 1987


  Loading...