中文
相关论文

相关论文: On the support designs of extremal binary doubly e…

200 篇论文

The minimum weight of the code generated by the incidence matrix of points versus lines in a projective plane has been known for over 50 years. Surprisingly, finding the minimum weight of the dual code of projective planes of non-prime…

组合数学 · 数学 2022-10-26 Maarten De Boeck , Geertrui Van de Voorde

This paper is concerned with the affine-invariant ternary codes which are defined by Hermitian functions. We compute the incidence matrices of 2-designs that are supported by the minimum weight codewords of these ternary codes. The linear…

信息论 · 计算机科学 2020-07-29 Zhiwen He , Jiejing Wen

There has been recent interest in the study of shortest self-orthogonal embeddings of binary linear codes, since many such codes are optimal self-orthogonal codes. Several authors have studied the length of a shortest self-orthogonal…

信息论 · 计算机科学 2025-11-10 Junmin An , Nathan Kaplan , Jon-Lark Kim , Jinquan Luo , Guodong Wang

It is known that all resolution IV regular $2^{n-m}$ designs of run size $N=2^{n-m}$ where $5N/16<n<N/2$ must be projections of the maximal even design with $N/2$ factors and, therefore, are even designs. This paper derives a general and…

统计理论 · 数学 2009-09-04 Hegang H. Chen , Ching-Shui Cheng

We give an explicit construction of length-$n$ binary codes capable of correcting the deletion of two bits that have size $2^n/n^{4+o(1)}$. This matches up to lower order terms the existential result, based on an inefficient greedy choice…

信息论 · 计算机科学 2020-07-22 Venkatesan Guruswami , Johan Håstad

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

信息论 · 计算机科学 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee

We present some basic theory on the duality of codes over two non-unital rings of order $6$, namely $H_{23}$ and $H_{32}$. For a code $\mathcal{C}$ over these rings, we associate a binary code $\mathcal{C}_a$ and a ternary code…

信息论 · 计算机科学 2025-02-26 Altaf Alshuhail , Rowena Alma Betty , Lucky Galvez

Let $A_2(n,d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$. In this paper we present the following new lower bounds: $A_2(18,4) \ge 5632$, $A_2(21,4) \ge 40960$, $A_2(22,4) \ge 81920$, $A_2(23,4) \ge 163840$,…

信息论 · 计算机科学 2016-07-19 Antti Laaksonen , Patric R. J. Östergård

A classification of Hadamard matrices of order $2p+2$ with an automorphism of order $p$ is given for $p=29$ and $31$. The ternary self-dual codes spanned by the newly found Hadamard matrices of order $60$ with an automorphism of order $29$…

组合数学 · 数学 2023-07-19 Makoto Araya , Masaaki Harada , Vladimir D. Tonchev

Self-orthogonal codes are an important subclass of linear codes which have nice applications in quantum codes and lattices. It is known that a binary linear code is self-orthogonal if its every codeword has weight divisible by four, and a…

信息论 · 计算机科学 2023-11-21 Xiaoru Li , Ziling Heng

Near maximum distance separable (NMDS) codes, where both the code and its dual are almost maximum distance separable, play pivotal roles in combinatorial design theory and cryptographic applications. Despite progress in fixed dimensions…

信息论 · 计算机科学 2025-04-10 Yaozong Zhang , Dabin Zheng , Xiaoqiang Wang , Wei Lu

This paper explores extremal self-dual double circulant (DC) codes and linear complementary dual (LCD) codes of arbitrary length over the Galois field $\mathbb F_2$. We establish the sufficient and necessary conditions for DC codes and…

信息论 · 计算机科学 2025-02-21 Wenyu Han , Tongjiang Yan , Ming Yan

A constant weight binary code consists of $n$-bit binary codewords, each with exactly $w$ bits equal to 1, such that any two codewords are at least Hamming distance $d$ apart. $A(n,d,w)$ is the maximum size of a constant weight binary code…

信息论 · 计算机科学 2026-03-03 Christopher D. Rosin

Motivated by the duplication-correcting problem for data storage in live DNA, we study the construction of constant-weight codes in $\ell_1$-metric. By using packings and group divisible designs in combinatorial design theory, we give…

信息论 · 计算机科学 2020-10-12 Tingting Chen , Yiming Ma , Xiande Zhang

The maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=6$, and constant dimension $k=4$ is $257$, where the $2$ isomorphism types are extended lifted maximum rank distance codes. In…

Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of…

信息论 · 计算机科学 2015-08-11 Liqing Xu , Hao Chen

A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…

信息论 · 计算机科学 2026-01-07 Murat Altunbulak , Fatma Altunbulak Aksu , Roghayeh Hafezieh , İpek Tuvay

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.

组合数学 · 数学 2012-05-28 Masaaki Harada , Akihiro Munemasa

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these…

组合数学 · 数学 2008-01-09 Lars Eirik Danielsen , Matthew G. Parker

In this paper we obtain at least 61 new singly even (Type I) binary [72,36,12] self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes) and at least 13 new doubly even (Type II) binary [72,36,12] self-dual codes by…

信息论 · 计算机科学 2017-05-17 Alexandre Zhdanov