Result 1 to 20 of 35 total
Visualization of quasi-median networks. (English)
Discrete Appl. Math. 159, No. 15, 1608-1616 (2011).
1
A new ward BRDF model with bounded albedo (English)
Comput. Graph. Forum 29, No. 4, 1391-1398 (2010).
2
Color-rendering indices in global illumination methods (English)
J. Electronic Imaging 18, No. 4, 043015 (2009).
3
Color rendering indices in global illumination methods (English)
Human Vision and Electronic Imaging, 72401 (2009).
4
An improved normalization for the ward reflectance model (English)
J. Graphics Tools 11, No. 1, 51-59 (2006).
5
A practical list-priority algorithm for 3D polygons. (English)
J. Graph. Tools 8, No. 4, 25-36 (2003).
6
On the optimality of the discrete Karhunen-Loève expansion. (English)
SIAM J. Control Optimization 36, No.6, 1937-1939 (1998).
7
A generalization of the Massey-Ding algorithm. (English)
Appl. Algebra Eng. Commun. Comput. 9, No.1, 1-14 (1998).
8
Finite linear recurring sequences and homogeneous ideals. (English)
Appl. Algebra Eng. Commun. Comput. 7, No.5, 377-390 (1996).
9
On the covering radius of Reed-Solomon codes. (English)
Discrete Math. 126, No.1-3, 99-105 (1994).
10
Applying coding theory to sparse interpolation. (English)
SIAM J. Comput. 22, No.4, 695-704 (1993).
11
Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder. (English)
IEEE Trans. Inf. Theory 39, No.2, 640-643 (1993).
12
Avoiding decoder malfunction in the Peterson-Gorenstein-zierler decoder (English)
IEEE Transactions on Information Theory 39, No. 2, 640-643 (1993).
13
A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes. (English)
IEEE Trans. Inf. Theory 38, No. 2, Part I, 504-509 (1992).
14
A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes (English)
IEEE Transactions on Information Theory 38, No. 2, 504-509 (1992).
15
The decoding of extended Reed-Solomon codes. (English)
Discrete Math. 90, No.1, 21-40 (1991).
16
Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6. (English)
Discrete Appl. Math. 33, No.1-3, 95-107 (1991).
17
On computing the canonical form for a binary form of odd degree. (English)
J. Symb. Comput. 8, No.4, 327-333 (1989).
18
On generalized minimum distance decoding. (English)
Applied algebra, algebraic algorithms and error-correcting codes, Proc. 5th Int. Conference, AAECC-5, Menorca, Spain, 1987, Lect. Notes Comput. Sci. 356, 202-215 (1989).
19
Correction to ’on the computation of the performance probabilities for block codes with a bounded-distance decoding rule’ (English)
IEEE Transactions on Information Theory 35, No. 1, 211- (1989).
20
Result 1 to 20 of 35 total
Start
Contact
Print
General Help
