196 research outputs found
Classification of quaternary Hermitian self-dual codes of length 20
A classification of quaternary Hermitian self-dual codes of length 20 is
given. Using this classification, a classification of extremal quaternary
Hermitian self-dual codes of length 22 is also given.Comment: 9 pages. To appear in IEEE Transactions on Information Theor
New cubic self-dual codes of length 54, 60 and 66
We study the construction of quasi-cyclic self-dual codes, especially of
binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell
with the algebraic approach of [9]. In particular, we improve the previous
results by constructing 1 new binary [54, 27, 10], 6 new [60, 30, 12] and 50
new [66, 33, 12] cubic self-dual codes. We conjecture that there exist no more
binary cubic self-dual codes with length 54, 60 and 66.Comment: 8 page
Classification of generalized Hadamard matrices H(6,3) and quaternary Hermitian self-dual codes of length 18
All generalized Hadamard matrices of order 18 over a group of order 3,
H(6,3), are enumerated in two different ways: once, as class regular symmetric
(6,3)-nets, or symmetric transversal designs on 54 points and 54 blocks with a
group of order 3 acting semi-regularly on points and blocks, and secondly, as
collections of full weight vectors in quaternary Hermitian self-dual codes of
length 18. The second enumeration is based on the classification of Hermitian
self-dual [18,9] codes over GF(4), completed in this paper. It is shown that up
to monomial equivalence, there are 85 generalized Hadamard matrices H(6,3), and
245 inequivalent Hermitian self-dual codes of length 18 over GF(4).Comment: 17 pages. Minor revisio
Construction of quasi-cyclic self-dual codes
There is a one-to-one correspondence between -quasi-cyclic codes over a
finite field and linear codes over a ring . Using this correspondence, we prove that every
-quasi-cyclic self-dual code of length over a finite field
can be obtained by the {\it building-up} construction, provided
that char or , is a prime , and
is a primitive element of . We determine possible weight
enumerators of a binary -quasi-cyclic self-dual code of length
(with a prime) in terms of divisibility by . We improve the result of
[3] by constructing new binary cubic (i.e., -quasi-cyclic codes of length
) optimal self-dual codes of lengths (Type I), 54 and
66. We also find quasi-cyclic optimal self-dual codes of lengths 40, 50, and
60. When , we obtain a new 8-quasi-cyclic self-dual code
over and a new 6-quasi-cyclic self-dual code over
. When , we find a new 4-quasi-cyclic self-dual
code over and a new 6-quasi-cyclic self-dual code
over .Comment: 25 pages, 2 tables; Finite Fields and Their Applications, 201
Self-Dual Codes
Self-dual codes are important because many of the best codes known are of
this type and they have a rich mathematical theory. Topics covered in this
survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight
enumerators, Gleason-Pierce theorem, invariant theory, Gleason theorems,
bounds, mass formulae, enumeration, extremal codes, open problems. There is a
comprehensive bibliography.Comment: 136 page
- …