arXiv 1706.034292017-06math.COcs.ITmath.IT

Some restrictions on weight enumerators of singly even self-dual codes II

Masaaki Harada, Akihiro Munemasa

备注：: 16 pages
发表信息：: Interdisciplinary Information Sciences Vol. 24, No. 1 (2018) 77-85
DOI：: 10.4036/iis.2017.R.03

英文摘要：

In this note, we give some restrictions on the number of vectors of weight $d/2+1$ in the shadow of a singly even self-dual $[n,n/2,d]$ code. This eliminates some of the possible weight enumerators of singly even self-dual $[n,n/2,d]$ codes for $(n,d)=(62,12)$, $(72,14)$, $(82,16)$, $(90,16)$ and $(100,18)$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Binary extremal self-dual codes of length $60$ and related codes

We give a classification of four-circulant singly even self-dual $[60,30,d]$ codes for $d=10$ and $12$. These codes are used to construct extremal singly even self-dual $[60,30,12]$ codes with weight enumerator for which no extremal singly even self-dual code was previously known to exist. From extremal singly even self-dual $[60,30,12]$ codes, we also construct extremal singly even self-dual $[58,29,10]$ codes with weight enumerator for which no extremal singly even self-dual code was previously known to exist. Finally, we give some restriction on the possible weight enumerators of certain si…

2017-06-06cs.ITmath.COmath.IT

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

Currently, the existence of an extremal singly even self-dual code of length $24k+10$ is unknown for all nonnegative integers $k$. In this note, we study singly even self-dual $[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]$ codes with shadows of minimum weight at least $5$ for $k=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]$ code with minimal shadow is constructed for the first time. In addition, as neighb…

2018-04-06cs.ITmath.COmath.IT

Some restrictions on the weight enumerators of near-extremal ternary self-dual codes and quaternary Hermitian self-dual codes

We give restrictions on the weight enumerators of ternary near-extremal self-dual codes of length divisible by $12$ and quaternary near-extremal Hermitian self-dual codes of length divisible by $6$. We consider the weight enumerators for which there is a ternary near-extremal self-dual code of length $12m$ for $m =3,4,5,6$. Also we consider the weight enumerators for which there is a quaternary near-extremal Hermitian self-dual code of length $6m$ for $m =4,5,6$.

2022-12-02cs.ITmath.COmath.IT

New extremal singly even self-dual codes of lengths $64$ and $66$

For lengths $64$ and $66$, we construct extremal singly even self-dual codes with weight enumerators for which no extremal singly even self-dual codes were previously known to exist. We also construct new $40$ inequivalent extremal doubly even self-dual $[64,32,12]$ codes with covering radius $12$ meeting the Delsarte bound.

2017-08-20cs.ITmath.COmath.IT

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

It is known that there is no extremal singly even self-dual $[n,n/2,d]$ code with minimal shadow for $(n,d)=(24m+2,4m+4)$, $(24m+4,4m+4)$, $(24m+6,4m+4)$, $(24m+10,4m+4)$ and $(24m+22,4m+6)$. In this paper, we study singly even self-dual codes with minimal shadow having minimum weight $d-2$ for these $(n,d)$. For $n=24m+2$, $24m+4$ and $24m+10$, we show that the weight enumerator of a singly even self-dual $[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]$ code with minimal shadow for $m \ge 155$, $m \ge 156$ an…

2017-07-13math.CO

New binary self-dual codes of lengths 56, 58, 64, 80 and 92 from a modification of the four circulant construction

In this work, we give a new technique for constructing self-dual codes over commutative Frobenius rings using $λ$-circulant matrices. The new construction was derived as a modification of the well-known four circulant construction of self-dual codes. Applying this technique together with the building-up construction, we construct singly-even binary self-dual codes of lengths 56, 58, 64, 80 and 92 that were not known in the literature before. Singly-even self-dual codes of length 80 with $β\in\{2,4,5,6,8\}$ in their weight enumerators are constructed for the first time in the literature.

2021-06-23cs.ITmath.COmath.IT

更多相关论文收起更多论文

New extremal binary self-dual codes from a modified four circulant construction

In this work, we propose a modified four circulant construction for self-dual codes and a bordered version of the construction using the properties of λ-circulant and λ-reverse circulant matrices. By using the constructions on $F_2$, we obtain new binary codes of lengths 64 and 68. We also apply the constructions to the ring $R_2$ and considering the $F_2$ and $R_1$-extensions, we obtain new singly-even extremal binary self-dual codes of lengths 66 and 68. More precisely, we find 3 new codes of length 64, 15 new codes of length 66 and 22 new codes of length 68. These codes all have weight enum…

2015-07-06cs.ITmath.COmath.IT

On the performance of optimal double circulant even codes

In this note, we investigate the performance of optimal double circulant even codes which are not self-dual, as measured by the decoding error probability in bounded distance decoding. To do this, we classify the optimal double circulant even codes that are not self-dual which have the smallest weight distribution for lengths up to $72$. We also give some restrictions on the weight enumerators of (extremal) self-dual $[54,27,10]$ codes with shadows of minimum weight $3$. Finally, we consider the performance of extremal self-dual codes of lengths $88$ and $112$.

2016-08-25cs.ITmath.COmath.IT

A note on Assmus--Mattson type theorems

In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of rank 24m with minimum norm 2m provides a spherical 3-design. We remark that some of such codes and lattices give t-designs for higher t. As a corollary, we give some restrictions on the weight enumerators of binary doubly even self-dual codes of length 24m with minimum weight 4m. Ternary and quaternary analogues are also given.

2020-12-20math.COmath.GRmath.NT

由2-(47,23,11)设计导出的长度为48的自对偶近极值三元码的新例子

New examples of self-dual near-extremal ternary codes of length 48 derived from 2-(47,23,11) designs

针对长度48的自对偶近极值三元码在$A_{12}$其他取值下的存在性问题，利用带6阶自同构群的对称2-(47,23,11)设计，构造出150个新$A_{12}$取值的该类码，拓展了已知实例范围。

2023-10-28math.CO