default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDW. Cary Huffman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2003
[b1]W. Cary Huffman, Vera Pless:
Fundamentals of Error-Correcting Codes. Cambridge University Press 2003, ISBN 978-0-51180707-7, pp. 1-646
Journal Articles
- 2022
- [j33]W. Cary Huffman, Jon-Lark Kim, Patrick Solé:
Guest editorial: On coding theory and combinatorics - in memory of Vera Pless. Des. Codes Cryptogr. 90(11): 2517-2527 (2022) - 2020
- [j32]W. Cary Huffman:
A tribute to Vera Pless (1931-2020). Finite Fields Their Appl. 65: 101675 (2020) - 2013
- [j31]W. Cary Huffman:
Self-dual 𝔽q-linear 𝔽t-codes with an automorphism of prime order. Adv. Math. Commun. 7(1): 57-90 (2013) - [j30]W. Cary Huffman:
On the theory of 𝔽q-linear 𝔽qt-codes. Adv. Math. Commun. 7(3): 349-378 (2013) - 2010
- [j29]W. Cary Huffman:
Cyclic double struck capital Fq-linear double struck capital Fqt-codes. Int. J. Inf. Coding Theory 1(3): 249-284 (2010) - 2009
- [j28]W. Cary Huffman:
Self-dual codes over F2 + uF2 with an automorphism of odd order. Finite Fields Their Appl. 15(3): 277-293 (2009) - 2008
- [j27]W. Cary Huffman:
Additive cyclic codes over F4. Adv. Math. Commun. 2(3): 309-343 (2008) - 2007
- [j26]W. Cary Huffman:
Additive self-dual codes over F4 with an automorphism of odd prime order. Adv. Math. Commun. 1(3): 357-398 (2007) - [j25]W. Cary Huffman:
Additive cyclic codes over F4. Adv. Math. Commun. 1(4): 427-459 (2007) - [j24]W. Cary Huffman:
On the decomposition of self-dual codes over F2+uF2 with an automorphism of odd prime order. Finite Fields Their Appl. 13(3): 681-712 (2007) - 2005
- [j23]W. Cary Huffman:
On the classification and enumeration of self-dual codes. Finite Fields Their Appl. 11(3): 451-490 (2005) - 2001
- [j22]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. Discret. Appl. Math. 111(1-2): 75-86 (2001) - 1999
- [j21]J. E. Fields, Philippe Gaborit, W. Cary Huffman, Vera Pless:
On the Classification of Extremal Even Formally Self-Dual Codes. Des. Codes Cryptogr. 18(1/3): 125-148 (1999) - 1998
- [j20]W. Cary Huffman:
Decompositions and Extremal Type II Codes over Z4. IEEE Trans. Inf. Theory 44(2): 800-809 (1998) - 1997
- [j19]W. Cary Huffman:
Characterization of quaternary extremal codes of lengths 18 and 20. IEEE Trans. Inf. Theory 43(5): 1613-1616 (1997) - 1996
- [j18]W. Cary Huffman:
The equivalence of two cyclic objects on pq elements. Discret. Math. 154(1-3): 103-127 (1996) - 1995
- [j17]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 Cryptogr. 6(2): 97-106 (1995) - [j16]W. Cary Huffman:
The automorphism groups of the generalized quadratic residue codes. IEEE Trans. Inf. Theory 41(2): 378-386 (1995) - 1993
- [j15]W. Cary Huffman, Vanessa R. Job, Vera Pless:
Multipliers and Generalized Multipliers of Cyclic Objects and Cyclic Codes. J. Comb. Theory A 62(2): 183-215 (1993) - 1992
- [j14]W. Cary Huffman:
On extremal self-dual ternary codes of lengths 28 to 40. IEEE Trans. Inf. Theory 38(4): 1395-1400 (1992) - 1991
- [j13]W. Cary Huffman:
On extremal self-dual quaternary codes of lengths 18 to 28 - II. IEEE Trans. Inf. Theory 37(4): 1206-1216 (1991) - 1990
- [j12]W. Cary Huffman:
On the equivalence of codes and codes with an automorphism having two cycles. Discret. Math. 83(2-3): 265-283 (1990) - [j11]W. Cary Huffman:
On extremal self-dual quaternary codes of lengths 18 to 28, I. IEEE Trans. Inf. Theory 36(3): 651-660 (1990) - [j10]W. Cary Huffman:
On 3-elements in monomial automorphism groups of quaternary codes. IEEE Trans. Inf. Theory 36(3): 660-664 (1990) - 1988
- [j9]W. Cary Huffman:
On the [24, 12, 10] quaternary code and binary codes with an automorphism having two cycles. IEEE Trans. Inf. Theory 34(3): 486-493 (1988) - 1987
- [j8]Neal Brand, W. Cary Huffman:
Constructions and Topological Invariants of 2-(ν, 3, λ) Designs with Group Actions. Eur. J. Comb. 8(1): 5-26 (1987) - [j7]Neal Brand, W. Cary Huffman:
Mendelsohn designs admitting the affine group. Graphs Comb. 3(1): 313-324 (1987) - [j6]W. Cary Huffman, Vassil Y. Yorgov:
A [72, 36, 16] doubly even code does not have an automorphism of order 11. IEEE Trans. Inf. Theory 33(5): 749-752 (1987) - 1986
- [j5]W. Cary Huffman:
On automorphism groups of certain 2-(v, 3, 2) designs induced by group actions. Discret. Math. 59(3): 283-296 (1986) - [j4]W. Cary Huffman:
Decomposing and shortening codes using automorphisms. IEEE Trans. Inf. Theory 32(6): 833-836 (1986) - 1984
- [j3]Neal Brand, W. Cary Huffman:
Topological Invariants of 2-Designs Arising from Difference Families. J. Comb. Theory A 36(3): 253-278 (1984) - 1982
- [j2]W. Cary Huffman:
Automorphisms of codes with applications to extremal doubly even codes of length 48. IEEE Trans. Inf. Theory 28(3): 511-521 (1982) - 1979
- [j1]W. Cary Huffman:
The biweight enumerator of self-orthogonal binary codes. Discret. Math. 26(2): 129-143 (1979)
Conference and Workshop Papers
- 1999
- [c1]Philippe Gaborit, W. Cary Huffman, Jon-Lark Kim, Vera Pless:
On additive GF(4) codes. Codes and Association Schemes 1999: 135-149
Parts in Books or Collections
- 2013
- [p4]Ian F. Blake, W. Cary Huffman:
Basic coding properties and bounds. Handbook of Finite Fields 2013: 659-702 - [p3]Ian F. Blake, W. Cary Huffman:
LDPC and Gallager codes over finite fields. Handbook of Finite Fields 2013: 713-726 - [p2]Ian F. Blake, W. Cary Huffman:
Raptor codes. Handbook of Finite Fields 2013: 727-740 - 2009
- [p1]W. Cary Huffman:
Additive Codes over F4 with Automorphisms. Algebraic Aspects of Digital Communications 2009: 1-22
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-01-21 00:17 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:
