4 research outputs found
Ternary maximal self-orthogonal codes of lengths and
We give a classification of ternary maximal self-orthogonal codes of lengths and . This completes a classification of ternary maximal self-orthogonal codes of lengths up to
A gluing technique for constructing relatively self-dual codes
AbstractIn this paper, we introduce self-dual codes relative to certain symmetric bilinear forms over a finite commutative ring. By refining the gluing theory of Conway, Pless, and Sloane, we obtain a gluing technique for constructing relatively self-dual codes. As examples of application of our technique, we find a construction of a self-dual binary [2(m + 3), m + 3, 6]-code from a self-dual [2m, m, l]-code with lβ©Ύ6, and a construction of doubly-even binary self-dual [2(m + 4), m + 4, 8]-code from a doubly even self-dual [2m, m, t]-code with t β©Ύ 8
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