| Publication | Date of Publication | Type |
|---|
Visualization of quasi-median networks
Discrete Applied Mathematics | 2011-10-27 | Paper |
| scientific article; zbMATH DE number 2109150 (Why is no real title available?) | 2004-10-21 | Paper |
On the canonical form for binary forms
Séminaire Lotharingien de Combinatoire | 2001-11-07 | Paper |
Möbius functions, incidence algebras and power series representations
Séminaire Lotharingien de Combinatoire | 2001-11-06 | Paper |
The automorphism group of Reed-Solomon codes
Séminaire Lotharingien de Combinatoire | 2001-11-05 | Paper |
Construction of all maximal codes using MDS codes
Séminaire Lotharingien de Combinatoire | 1999-06-27 | Paper |
Construction of all maximal codes using MDS codes
Séminaire Lotharingien de Combinatoire | 1999-06-27 | Paper |
On the Optimality of the Discrete Karhunen--Loève Expansion
SIAM Journal on Control and Optimization | 1998-09-21 | Paper |
A generalization of the Massey-Ding algorithm
Applicable Algebra in Engineering, Communication and Computing | 1998-08-12 | Paper |
Finite linear recurring sequences and homogeneous ideals
Applicable Algebra in Engineering, Communication and Computing | 1997-07-29 | Paper |
On the covering radius of Reed-Solomon codes
Discrete Mathematics | 1994-04-04 | Paper |
Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder
IEEE Transactions on Information Theory | 1993-09-16 | Paper |
A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6
Discrete Applied Mathematics | 1992-06-27 | Paper |
The decoding of extended Reed-Solomon codes
Discrete Mathematics | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4104869 (Why is no real title available?) | 1989-01-01 | Paper |
On computing the canonical form for a binary form of odd degree
Journal of Symbolic Computation | 1989-01-01 | Paper |
On linear MDS codes of length \(q+1\) over GF(q) for even q
Journal of Combinatorial Theory. Series A | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4063001 (Why is no real title available?) | 1988-01-01 | Paper |
On the computation of the performance probabilities for block codes with a bounded-distance decoding rule
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
The automorphism groups of Reed-Solomon codes
Journal of Combinatorial Theory. Series A | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3908334 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3838263 (Why is no real title available?) | 1982-01-01 | Paper |
Möbius Functions, Incidence Algebras and Power Series Representations
Lecture Notes in Mathematics | 0001-01-03 | Paper |
