The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harold N. Ward: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Simeon Ball, Ray Hill, Ivan N. Landjev, Harold N. Ward
    On (q2+q+2, q+2)-arcs in the Projective Plane PG(2, q). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:24, n:2, pp:205-224 [Journal]
  2. Gary McGuire, Vladimir D. Tonchev, Harold N. Ward
    Characterizing the Hermitian and Ree Unitals on 28 Points. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:13, n:1, pp:57-61 [Journal]
  3. Harold N. Ward
    The Nonexistence of a [207, 4, 165] Code over GF(5). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:22, n:2, pp:139-148 [Journal]
  4. Harold N. Ward
    A Sequence of Unique Quaternary Griesmer Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:33, n:1, pp:71-85 [Journal]
  5. Harold N. Ward
    An Introduction to Divisible Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:17, n:1-3, pp:73-79 [Journal]
  6. Carl Bracken, Gary McGuire, Harold N. Ward
    New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:41, n:2, pp:195-198 [Journal]
  7. F. J. MacWilliams, Andrew M. Odlyzko, N. J. A. Sloane, Harold N. Ward
    Self-Dual Codes over GF(4). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:25, n:3, pp:288-318 [Journal]
  8. Gary McGuire, Harold N. Ward
    Characterization of Certain Minimal Rank Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:83, n:1, pp:42-56 [Journal]
  9. Harold N. Ward
    The Divisible Code Bound Revisited. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:94, n:1, pp:34-50 [Journal]
  10. Harold N. Ward
    A Restriction on the Weight Enumerator of a Self-Dual Code. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:21, n:2, pp:253-255 [Journal]
  11. Harold N. Ward
    Divisibility of Codes Meeting the Griesmer Bound. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:83, n:1, pp:79-93 [Journal]
  12. Harold N. Ward, Jay A. Wood
    Characters and the Equivalence of Codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:73, n:2, pp:348-352 [Journal]
  13. Harold N. Ward, L. Zhu
    Existence of Abelian Group Code Partitions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:67, n:2, pp:276-281 [Journal]
  14. Harold N. Ward
    Divisors of codeword weights. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:337-341 [Journal]
  15. Harold N. Ward
    Quadratic residue codes of length 27. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:4, pp:950-0 [Journal]
  16. Harold N. Ward
    A bound for divisible codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:1, pp:191-0 [Journal]
  17. Ray Hill, Harold N. Ward
    A geometric approach to classifying Griesmer codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:44, n:1-3, pp:169-196 [Journal]
  18. Harold N. Ward
    Weight polarization and divisibility. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:83, n:2-3, pp:315-326 [Journal]
  19. Harold N. Ward
    Divisors of codes of Reed-Muller type. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:131, n:1-3, pp:311-323 [Journal]

  20. Optimal Four-Dimensional Codes over GF(8). [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002