default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDouglas A. Leonard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j14]Douglas A. Leonard:
A weighted module view of integral closures of affine domains of type I. Adv. Math. Commun. 3(1): 1-11 (2009)- [p3]Douglas A. Leonard:
A Tutorial on AG Code Construction from a Gröbner Basis Perspective. Gröbner Bases, Coding, and Cryptography 2009: 93-106 - [p2]Douglas A. Leonard:
Using Gröbner Bases to Investigate Flag Algebras and Association Scheme Fusion. Algorithmic Algebraic Combinatorics and Gröbner Bases 2009: 113-135 - [p1]Douglas A. Leonard:
A Tutorial on AG Code Decoding from a Gröbner Basis Perspective. Gröbner Bases, Coding, and Cryptography 2009: 187-196 - 2001
- [j13]Douglas A. Leonard:
Finding the defining functions for one-point algebraic-geometry codes. IEEE Trans. Inf. Theory 47(6): 2566-2573 (2001) - 2000
- [j12]Douglas A. Leonard:
Ideals, varieties, and algorithms. IEEE Trans. Inf. Theory 46(2): 724-734 (2000)
1990 – 1999
- 1999
- [j11]Douglas A. Leonard:
Efficient Forney Functions for Decoding AG Codes. IEEE Trans. Inf. Theory 45(1): 260-265 (1999) - 1998
- [j10]Shojiro Sakata, Douglas A. Leonard, Helge Elbrønd Jensen, Tom Høholdt:
Fast Erasure-and-Error Decoding of Algebraic Geometry Codes up to the Feng-Rao Bound. IEEE Trans. Inf. Theory 44(4): 1558-1564 (1998) - 1996
- [j9]Douglas A. Leonard:
A generalized Forney formula for algebraic-geometric codes. IEEE Trans. Inf. Theory 42(4): 1263-1268 (1996) - 1995
- [j8]Douglas A. Leonard:
Error-locator ideals for algebraic-geometric codes. IEEE Trans. Inf. Theory 41(3): 819-824 (1995) - 1993
- [j7]Douglas A. Leonard, Kazuamsa Nomura:
The Girth of a Directed Distance-Regular Graph. J. Comb. Theory B 58(1): 34-39 (1993) - 1991
- [j6]Douglas A. Leonard:
Linear Cyclic Codes of Wordlength v over GF(qs) Which are Also Linear Cyclic Codes of Worklength sv over GF(q). Des. Codes Cryptogr. 1(2): 183-189 (1991) - [j5]Douglas A. Leonard:
Non-symmetric, metric, cometric association schemes are self-dual. J. Comb. Theory B 51(2): 244-247 (1991) - 1990
- [j4]Douglas A. Leonard:
Directed distance regular graphs with the Q-polynomial property. J. Comb. Theory B 48(2): 191-196 (1990)
1980 – 1989
- 1989
- [j3]Douglas A. Leonard, C. A. Rodger:
Limiting error propagation in Viterbi decoding of convolutional codes. IEEE Trans. Inf. Theory 35(6): 1295-1299 (1989) - 1984
- [j2]Douglas A. Leonard:
Parameters of Association Schemes That Are Both P- and Q-Polynomial. J. Comb. Theory A 36(3): 355-363 (1984) - [c1]Douglas A. Leonard, C. A. Rodger:
Explicit Kerdock codes over GF(2). AAECC 1984: 130-135
1970 – 1979
- 1977
- [j1]Douglas A. Leonard, D. Keenan:
On a Theorem of Ryser. J. Comb. Theory A 23(3): 354-358 (1977)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
