 | 2010 |
| 25 |  | W. Cary Huffman:
Cyclic double struck capital Fq-linear double struck capital Fqt-codes.
IJICoT 1(3): 249-284 (2010) |
| 2009 |
| 24 |  | W. Cary Huffman:
Additive Codes over F4 with Automorphisms.
Algebraic Aspects of Digital Communications 2009: 1-22 |
| 23 |  | W. Cary Huffman:
Self-dual codes over F2 + uF2 with an automorphism of odd order.
Finite Fields and Their Applications 15(3): 277-293 (2009) |
| 2007 |
| 22 |  | W. Cary Huffman:
On the decomposition of self-dual codes over F2+uF2 with an automorphism of odd prime order.
Finite Fields and Their Applications 13(3): 681-712 (2007) |
| 2005 |
| 21 |  | W. Cary Huffman:
On the classification and enumeration of self-dual codes.
Finite Fields and Their Applications 11(3): 451-490 (2005) |
| 2001 |
| 20 |  | J. E. Fields,
Philippe Gaborit,
W. Cary Huffman,
Vera Pless:
On the classification of extremal even formally self-dual codes of lengths 20 and 22.
Discrete Applied Mathematics 111(1-2): 75-86 (2001) |
| 1999 |
| 19 |  | J. E. Fields,
Philippe Gaborit,
W. Cary Huffman,
Vera Pless:
On the Classification of Extremal Even Formally Self-Dual Codes.
Des. Codes Cryptography 18(1/3): 125-148 (1999) |
| 1998 |
| 18 |  | W. Cary Huffman:
Decompositions and Extremal Type II Codes over Z4.
IEEE Transactions on Information Theory 44(2): 800-809 (1998) |
| 1997 |
| 17 |  | W. Cary Huffman:
Characterization of quaternary extremal codes of lengths 18 and 20.
IEEE Transactions on Information Theory 43(5): 1613-1616 (1997) |
| 1996 |
| 16 |  | W. Cary Huffman:
The equivalence of two cyclic objects on pq elements.
Discrete Mathematics 154(1-3): 103-127 (1996) |
| 1995 |
| 15 |  | W. Cary Huffman,
Vladimir D. Tonchev:
The Existence of Extremal Self-Dual [50, 25, 10] Codes and Quasi-Symmetric 2-(49, 9, 6) Designs.
Des. Codes Cryptography 6(2): 97-106 (1995) |
| 14 |  | W. Cary Huffman:
The automorphism groups of the generalized quadratic residue codes.
IEEE Transactions on Information Theory 41(2): 378-386 (1995) |
| 1993 |
| 13 |  | W. Cary Huffman,
Vanessa R. Job,
Vera Pless:
Multipliers and Generalized Multipliers of Cyclic Objects and Cyclic Codes.
J. Comb. Theory, Ser. A 62(2): 183-215 (1993) |
| 1992 |
| 12 |  | W. Cary Huffman:
On extremal self-dual ternary codes of lengths 28 to 40.
IEEE Transactions on Information Theory 38(4): 1395-1400 (1992) |
| 1991 |
| 11 |  | W. Cary Huffman:
On extremal self-dual quaternary codes of lengths 18 to 28 - II.
IEEE Transactions on Information Theory 37(4): 1206-1216 (1991) |
| 1990 |
| 10 |  | W. Cary Huffman:
On the equivalence of codes and codes with an automorphism having two cycles.
Discrete Mathematics 83(2-3): 265-283 (1990) |
| 9 |  | W. Cary Huffman:
On extremal self-dual quaternary codes of lengths 18 to 28, I.
IEEE Transactions on Information Theory 36(3): 651-660 (1990) |
| 8 |  | W. Cary Huffman:
On 3-elements in monomial automorphism groups of quaternary codes.
IEEE Transactions on Information Theory 36(3): 660-664 (1990) |
| 1988 |
| 7 |  | W. Cary Huffman:
On the [24, 12, 10] quaternary code and binary codes with an automorphism having two cycles.
IEEE Transactions on Information Theory 34(3): 486-493 (1988) |
| 1987 |
| 6 |  | Neal Brand,
W. Cary Huffman:
Mendelsohn designs admitting the affine group.
Graphs and Combinatorics 3(1): 313-324 (1987) |
| 5 |  | W. Cary Huffman,
Vassil Y. Yorgov:
A [72, 36, 16] doubly even code does not have an automorphism of order 11.
IEEE Transactions on Information Theory 33(5): 749-752 (1987) |
| 1986 |
| 4 |  | W. Cary Huffman:
On automorphism groups of certain 2-(v, 3, 2) designs induced by group actions.
Discrete Mathematics 59(3): 283-296 (1986) |
| 3 |  | W. Cary Huffman:
Decomposing and shortening codes using automorphisms.
IEEE Transactions on Information Theory 32(6): 833-836 (1986) |
| 1984 |
| 2 |  | Neal Brand,
W. Cary Huffman:
Topological Invariants of 2-Designs Arising from Difference Families.
J. Comb. Theory, Ser. A 36(3): 253-278 (1984) |
| 1982 |
| 1 |  | W. Cary Huffman:
Automorphisms of codes with applications to extremal doubly even codes of length 48.
IEEE Transactions on Information Theory 28(3): 511-521 (1982) |