W. Cary Huffman

dblp:18/4963 · DBLP profile ↗
← Back
15ranked-venue papers
13as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 12 · 11 first-authorSecurity and privacy · 3 · 2 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
11 papers
Coding theory · 100%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes › linear code
self-dual codes
0.191998
Decompositions and Extremal Type II Codes over Z4 · IEEE Trans. Inf. Theory 1998
Characterization of quaternary extremal codes of lengths 18 and 20 · IEEE Trans. Inf. Theory 1997
On extremal self-dual ternary codes of lengths 28 to 40 · IEEE Trans. Inf. Theory 1992
Coding theory › error-correcting codes › algebraic coding theory
code automorphisms
0.1101998
Decompositions and Extremal Type II Codes over Z4 · IEEE Trans. Inf. Theory 1998
The automorphism groups of the generalized quadratic residue codes · IEEE Trans. Inf. Theory 1995
On extremal self-dual ternary codes of lengths 28 to 40 · IEEE Trans. Inf. Theory 1992
Coding theory › error-correcting codes › block codes › linear code › self-dual codes
quaternary self-dual codes
0.051997
Characterization of quaternary extremal codes of lengths 18 and 20 · IEEE Trans. Inf. Theory 1997
On extremal self-dual quaternary codes of lengths 18 to 28 - II · IEEE Trans. Inf. Theory 1991
On 3-elements in monomial automorphism groups of quaternary codes · IEEE Trans. Inf. Theory 1990
Coding theory › error-correcting codes › optimal codes
extremal codes
0.041997
Characterization of quaternary extremal codes of lengths 18 and 20 · IEEE Trans. Inf. Theory 1997
On extremal self-dual ternary codes of lengths 28 to 40 · IEEE Trans. Inf. Theory 1992
On extremal self-dual quaternary codes of lengths 18 to 28 - II · IEEE Trans. Inf. Theory 1991
Coding theory
code decomposition
0.051998
Decompositions and Extremal Type II Codes over Z4 · IEEE Trans. Inf. Theory 1998
On 3-elements in monomial automorphism groups of quaternary codes · IEEE Trans. Inf. Theory 1990
On the [24, 12, 10] quaternary code and binary codes with an automorphism having two cycles · IEEE Trans. Inf. Theory 1988
Coding theory › error-correcting codes › codes over rings
z4-linear code
0.011998
Decompositions and Extremal Type II Codes over Z4 · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes
quadratic residue code
0.021995
The automorphism groups of the generalized quadratic residue codes · IEEE Trans. Inf. Theory 1995
Automorphisms of codes with applications to extremal doubly even codes of length 48 · IEEE Trans. Inf. Theory 1982
Coding theory › error-correcting codes › block codes › linear code
automorphism group
0.011995
The automorphism groups of the generalized quadratic residue codes · IEEE Trans. Inf. Theory 1995
Coding theory › error-correcting codes › block codes › linear code › self-dual codes
ternary self-dual codes
0.011992
On extremal self-dual ternary codes of lengths 28 to 40 · IEEE Trans. Inf. Theory 1992
Coding theory › lattice codes
lattice construction
0.011998
Decompositions and Extremal Type II Codes over Z4 · IEEE Trans. Inf. Theory 1998
Coding theory › lattice codes
leech lattice
0.011998
Decompositions and Extremal Type II Codes over Z4 · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › block codes › linear code › self-dual codes
doubly even codes
0.011987
A [72, 36, 16] doubly even code does not have an automorphism of order 11 · IEEE Trans. Inf. Theory 1987

Methods — techniques the papers use, named apart from their topics

decomposition theory · 0.0decomposition theorem · 0.0code equivalence · 0.0code enumeration · 0.0semiaffine transformation analysis · 0.0direct sum decomposition · 0.0code equivalence testing · 0.0automorphism group analysis · 0.0
YearPublicationVenuePosition
2022 Guest editorial: On coding theory and combinatorics - in memory of Vera Pless
W. Cary Huffman, Jon-Lark Kim, Patrick Solé
Des. Codes Cryptogr.1
2001 On the classification of extremal even formally self-dual codes of lengths 20 and 22
Joe Fields, Philippe Gaborit, W. Cary Huffman, Vera Pless
Discret. Appl. Math.3
1999 On the Classification of Extremal Even Formally Self-Dual Codes
Joe Fields, Philippe Gaborit, W. Cary Huffman, Vera Pless
Des. Codes Cryptogr.3
1998 Decompositions and Extremal Type II Codes over Z4
abstract
In previous work by Huffman and by Yorgov (1983), a decomposition theory of self-dual linear codes C over a finite field F/sub q/ was given when C has a permutation automorphism of prime order r relatively prime to q. We extend these results to linear codes over the Galois ring Z/sub 4/ and apply the theory to Z/sub 4/-codes of length 24. In particular we obtain 42 inequivalent [24,12] Z/sub 4/-codes of minimum Euclidean weight 16 which lead to 42 constructions of the Leech lattice.
W. Cary Huffman
IEEE Trans. Inf. Theory1
1997 Characterization of quaternary extremal codes of lengths 18 and 20
abstract
We prove that, up to equivalence, there is a unique extremal quaternary Hermitian self-dual code of length 18, and that there are two inequivalent extremal quaternary Hermitian self-dual codes of length 20.
W. Cary Huffman
IEEE Trans. Inf. Theory1
1995 The Existence of Extremal Self-Dual [50, 25, 10] Codes and Quasi-Symmetric 2-(49, 9, 6) Designs
W. Cary Huffman, Vladimir D. Tonchev
Des. Codes Cryptogr.1
1995 The automorphism groups of the generalized quadratic residue codes
abstract
We give the full automorphism groups as groups of semiaffine transformations, of the extended generalized quadratic residue codes. We also present a proof of the Gleason-Prange theorem for the extended generalized quadratic residue codes that relies only on their definition and elementary theory of linear characters.>
W. Cary Huffman
IEEE Trans. Inf. Theory1
1992 On extremal self-dual ternary codes of lengths 28 to 40
abstract
The extremal self-dual ternary codes of lengths 28, 32, and 36 with monomial automorphisms of prime order r>or=5 and of length 40 with monomial automorphisms of prime order r>5 are enumerated. For each length and prime considered, all inequivalent extremal codes with an automorphism of that order are found.>
W. Cary Huffman
IEEE Trans. Inf. Theory1
1991 On extremal self-dual quaternary codes of lengths 18 to 28 - II
abstract
For pt.I see ibid., vol.36, no.3, p.651-60 (1990). A general decomposition theorem is applied to find all extremal self-dual quaternary codes of lengths 18 to 28 that have a nontrivial monomial automorphism of order a power of 3. Techniques to distinguish these codes are also presented. The author presents situations in which the equivalence of the codes under consideration can be decided.>
W. Cary Huffman
IEEE Trans. Inf. Theory1
1990 On extremal self-dual quaternary codes of lengths 18 to 28, I
abstract
A general decomposition theorem is given for self-dual codes over finite fields that have a permutation automorphism of a given form. Such a code can be decomposed as a direct sum of subcodes that may be viewed as shorter-length codes over extension fields where the dual of each direct summand is also a direct summand. Situations in which it is easy to distinguish such codes are also presented. These results are used to enumerate some of the extremal quaternary self-dual codes of lengths 18, 20, 22, 26 and 28.>
W. Cary Huffman
IEEE Trans. Inf. Theory1
1990 On 3-elements in monomial automorphism groups of quaternary codes
abstract
A general theory is given for examining quaternary self-dual codes having monomial automorphisms of orders that are a power of 3. A theory of decomposing such codes is given and applications of this theory are described. This work extends similar work when the codes have nontrivial odd-order permutation automorphisms.>
W. Cary Huffman
IEEE Trans. Inf. Theory1
1988 On the [24, 12, 10] quaternary code and binary codes with an automorphism having two cycles
abstract
A general decomposition theorem is given for codes over finite fields which have an automorphism of a given type. Such codes can be decomposed as direct sums of subcodes which may be viewed as shorter length codes over extension fields. If such a code is self-dual, sometimes the subcodes are also. This decomposition is applied to prove that the self-dual (24, 12, 10) quaternary code has no automorphism of order 3. This decomposition is also applied to count the number of equivalent (2r, r) and (2r+2r+1) self-dual binary codes with an automorphism of prime order r.>
W. Cary Huffman
IEEE Trans. Inf. Theory1
1987 A [72, 36, 16] doubly even code does not have an automorphism of order 11
abstract
We prove that there does not exist a[72,36,16]doubly even code with an automorphism of order11. If such a code exists, it can be decomposed as a direct sum of two codes; one can be viewed as a self-dual[12,6,4]binary code and the other a self-dual[6,3,4]code overF_{1024}. This is shown to be impossible.
W. Cary Huffman, Vassil Y. Yorgov
IEEE Trans. Inf. Theory1
1986 Decomposing and shortening codes using automorphisms
abstract
Codes possessing certain types of automorphisms are examined. In one case, the code can be decomposed as a direct sum of two subcodes, which can be viewed as shorter length codes. In a second case, the code itself corresponds to a shorter length code. Related results and applications are given.
W. Cary Huffman
IEEE Trans. Inf. Theory1
1982 Automorphisms of codes with applications to extremal doubly even codes of length 48
abstract
General results on automorphisms of self-dual binary codes are given. These results are applied to the study of extremal self-dual doubly even binary codes of length48. The main theorem proved is that an extremal self-dual doubly even code of length48with a nontrivial automorphism of odd order is equivalent to the extended quadratic residue code. Interesting constructions of the binary extended Golay code as well as a conjecture about a possible connection between an extremal self-dual doubly even code of length72and an extremal quaternary code of length24arc yielded by techniques used in the proof.
W. Cary Huffman
IEEE Trans. Inf. Theory1