default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarold N. Ward
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j26]Vassili C. Mavron, Harold N. Ward:
Designer of codes: a tribute to Jennifer Key. Des. Codes Cryptogr. 93(1): 1-10 (2025)
2010 – 2019
- 2010
- [j25]Harold N. Ward:
A selection of divisible lexicographic codes. Int. J. Inf. Coding Theory 1(4): 410-428 (2010)
2000 – 2009
- 2007
- [j24]Jyrki T. Lahtonen, Gary McGuire, Harold N. Ward:
Gold and Kasami-Welch functions, quadratic forms, and bent functions. Adv. Math. Commun. 1(2): 243-250 (2007) - [j23]Ray Hill, Harold N. Ward:
A geometric approach to classifying Griesmer codes. Des. Codes Cryptogr. 44(1-3): 169-196 (2007) - 2006
- [j22]Christopher Jones, Angela Matney, Harold N. Ward:
Optimal Four-Dimensional Codes over GF(8). Electron. J. Comb. 13(1) (2006) - [j21]Carl Bracken, Gary McGuire, Harold N. Ward:
New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices. Des. Codes Cryptogr. 41(2): 195-198 (2006) - 2004
- [j20]Harold N. Ward:
A Sequence of Unique Quaternary Griesmer Codes. Des. Codes Cryptogr. 33(1): 71-85 (2004) - 2001
- [j19]Harold N. Ward:
The Nonexistence of a [207, 4, 165] Code over GF(5). Des. Codes Cryptogr. 22(2): 139-148 (2001) - [j18]Simeon Ball, Ray Hill, Ivan N. Landjev, Harold N. Ward:
On (q2+q+2, q+2)-arcs in the Projective Plane PG(2, q). Des. Codes Cryptogr. 24(2): 205-224 (2001) - [j17]Harold N. Ward:
The Divisible Code Bound Revisited. J. Comb. Theory A 94(1): 34-50 (2001)
1990 – 1999
- 1999
- [j16]Harold N. Ward:
An Introduction to Divisible Codes. Des. Codes Cryptogr. 17(1-3): 73-79 (1999) - 1998
- [j15]Gary McGuire, Vladimir D. Tonchev
, Harold N. Ward:
Characterizing the Hermitian and Ree Unitals on 28 Points. Des. Codes Cryptogr. 13(1): 57-61 (1998) - [j14]Gary McGuire, Harold N. Ward:
Characterization of Certain Minimal Rank Designs. J. Comb. Theory A 83(1): 42-56 (1998) - [j13]Harold N. Ward:
Divisibility of Codes Meeting the Griesmer Bound. J. Comb. Theory A 83(1): 79-93 (1998) - 1996
- [j12]Harold N. Ward, Jay A. Wood:
Characters and the Equivalence of Codes. J. Comb. Theory A 73(2): 348-352 (1996) - 1994
- [j11]Harold N. Ward:
Divisors of codes of Reed-Muller type. Discret. Math. 131(1-3): 311-323 (1994) - [j10]Harold N. Ward, L. Zhu:
Existence of Abelian Group Code Partitions. J. Comb. Theory A 67(2): 276-281 (1994) - 1992
- [j9]Patrick Stevens, Harold N. Ward:
Decoding binary two-error correcting cyclic codes with Zech logarithms. IEEE Trans. Commun. 40(12): 1789-1792 (1992) - [j8]Harold N. Ward:
A bound for divisible codes. IEEE Trans. Inf. Theory 38(1): 191-194 (1992) - 1990
- [j7]Harold N. Ward:
Weight polarization and divisibility. Discret. Math. 83(2-3): 315-326 (1990) - [j6]Harold N. Ward:
Quadratic residue codes of length 27. IEEE Trans. Inf. Theory 36(4): 950-953 (1990)
1980 – 1989
- 1983
- [j5]Harold N. Ward:
Divisors of codeword weights. IEEE Trans. Inf. Theory 29(3): 337-341 (1983) - 1980
- [j4]Vera Pless, Neil J. A. Sloane, Harold N. Ward:
Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20. IEEE Trans. Inf. Theory 26(3): 305-316 (1980)
1970 – 1979
- 1979
- [j3]Harold N. Ward:
Combinatorial polarization. Discret. Math. 26(2): 185-197 (1979) - 1978
- [j2]F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane, Harold N. Ward:
Self-Dual Codes over GF(4). J. Comb. Theory A 25(3): 288-318 (1978) - 1976
- [j1]Harold N. Ward:
A Restriction on the Weight Enumerator of a Self-Dual Code. J. Comb. Theory A 21(2): 253-255 (1976)
Coauthor Index
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-02-02 22:30 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:
