Upper bounds for A(n, 4) and A(n, 6) derived from Delsarte's linear programming bound. - Cees Roos; Cornelis de Vroedt (Discret. Math., 1982)

The minimum distance of the [38, 19] ternary extended QR-code is 11. - J. C. C. M. Remijn; Cornelis de Vroedt (IEEE Trans. Inf. Theory, 1984)

New upper bounds on the size of codes correcting asymmetric errors. - Jacobus H. Weber; Cornelis de Vroedt; Dick E. Boekee (IEEE Trans. Inf. Theory, 1987)

A direct proof of the weight retaining property of polynomials over a finite field. - R. L. A. van Ravesteijn; Cornelis de Vroedt (IEEE Trans. Inf. Theory, 1988)

Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6. - Jacobus H. Weber; Cornelis de Vroedt; Dick E. Boekee (IEEE Trans. Inf. Theory, 1988)

Bounds and constructions for codes correcting unidirectional errors. - Jacobus H. Weber; Cornelis de Vroedt; Dick E. Boekee (IEEE Trans. Inf. Theory, 1989)

A Simple Proof of the Delsarte Inequalities. - Juriaan Simonis; Cornelis de Vroedt (Des. Codes Cryptogr., 1991)

On the maximum cardinality of binary constant weight codes with prescribed distance. - Cornelis de Vroedt (Discret. Math., 1991)

Über einen Satz von Köhler. - Cornelis de Vroedt (Discret. Math., 1991)

Necessary and Sufficient Conditions on Block Codes Correcting/Detecting Errors of Various Types. - Jacobus H. Weber; Cornelis de Vroedt; Dick E. Boekee (IEEE Trans. Computers, 1992)