Douglas A. Leonard Linear Cyclic Codes of Wordlength v over GF(qs) Which are Also Linear Cyclic Codes of Worklength sv oper GF(q). [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1991, v:1, n:2, pp:183-189 [Journal]
Douglas A. Leonard Parameters of Association Schemes That Are Both P- and Q-Polynomial. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1984, v:36, n:3, pp:355-363 [Journal]
Douglas A. Leonard Directed distance regular graphs with the Q-polynomial property. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1990, v:48, n:2, pp:191-196 [Journal]
Douglas A. Leonard Non-symmetric, metric, cometric association schemes are self-dual. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1991, v:51, n:2, pp:244-247 [Journal]
Douglas A. Leonard Finding the defining functions for one-point algebraic-geometry codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2566-2573 [Journal]
Douglas A. Leonard Error-locator ideals for algebraic-geometric codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:3, pp:819-824 [Journal]
Douglas A. Leonard A generalized Forney formula for algebraic-geometric codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1263-1268 [Journal]
Douglas A. Leonard Efficient Forney Functions for Decoding AG Codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:260-265 [Journal]