3 research outputs found

    Nonexistence of certain singly even self-dual codes with minimal shadow

    Full text link
    It is known that there is no extremal singly even self-dual [n,n/2,d][n,n/2,d] code with minimal shadow for (n,d)=(24m+2,4m+4)(n,d)=(24m+2,4m+4), (24m+4,4m+4)(24m+4,4m+4), (24m+6,4m+4)(24m+6,4m+4), (24m+10,4m+4)(24m+10,4m+4) and (24m+22,4m+6)(24m+22,4m+6). In this paper, we study singly even self-dual codes with minimal shadow having minimum weight dβˆ’2d-2 for these (n,d)(n,d). For n=24m+2n=24m+2, 24m+424m+4 and 24m+1024m+10, we show that the weight enumerator of a singly even self-dual [n,n/2,4m+2][n,n/2,4m+2] code with minimal shadow is uniquely determined and we also show that there is no singly even self-dual [n,n/2,4m+2][n,n/2,4m+2] code with minimal shadow for mβ‰₯155m \ge 155, mβ‰₯156m \ge 156 and mβ‰₯160m \ge 160, respectively. We demonstrate that the weight enumerator of a singly even self-dual code with minimal shadow is not uniquely determined for parameters [24m+6,12m+3,4m+2][24m+6,12m+3,4m+2] and [24m+22,12m+11,4m+4][24m+22,12m+11,4m+4].Comment: 16 page

    Singly even self-dual codes of length 24k+1024k+10 and minimum weight 4k+24k+2

    Full text link
    Currently, the existence of an extremal singly even self-dual code of length 24k+1024k+10 is unknown for all nonnegative integers kk. In this note, we study singly even self-dual [24k+10,12k+5,4k+2][24k+10,12k+5,4k+2] codes. We give some restrictions on the possible weight enumerators of singly even self-dual [24k+10,12k+5,4k+2][24k+10,12k+5,4k+2] codes with shadows of minimum weight at least 55 for k=2,3,4,5k=2,3,4,5. We discuss a method for constructing singly even self-dual codes with minimal shadow. As an example, a singly even self-dual [82,41,14][82,41,14] code with minimal shadow is constructed for the first time. In addition, as neighbors of the code, we construct singly even self-dual [82,41,14][82,41,14] codes with weight enumerator for which no singly even self-dual code was previously known to exist.Comment: 16 page

    New MDS Self-dual Codes over Finite Fields of Odd Characteristic

    Full text link
    In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many MDS self-dual codes with new parameters which have never been reported. For odd prime power qq with qq square, the total number of lengths for MDS self-dual codes over Fq\mathbb{F}_q presented in this paper is much more than those in all the previous results
    corecore