中文
相关论文

相关论文: There is no [21, 5, 14] code over F5

200 篇论文

We prove that a putative $[72,36,16]$ code is not the image of linear code over $\ZZ_4$, $\FF_2 + u \FF_2$ or $\FF_2+v\FF_2$, thus proving that the extremal doubly even $[72,36,16]$-binary code cannot have an automorphism group containing a…

组合数学 · 数学 2013-03-26 Steven T Dougherty , Suat Karadeniz , Bahattin Yildiz

We show that no projective 16-divisible binary linear code of length 131 exists. This implies several improved upper bounds for constant-dimension codes, used in random linear network coding, and partial spreads.

信息论 · 计算机科学 2020-10-13 Sascha Kurz

We describe all of the smooth complete toric threefolds of Picard number 5 with no nontrivial nef line bundles, and show that no such examples exist with Picard number less than 5.

代数几何 · 数学 2007-06-23 Osamu Fujino , Sam Payne

We obtain an explicit formula for the number of permutations of [n] that avoid the barred pattern bar{1}43bar{5}2. A curious feature of its counting sequence, 1, 1, 2, 5, 14, 43, 145, 538, 2194,..., is that the displayed terms agree with…

组合数学 · 数学 2011-11-29 David Callan

We shall show that there is no odd perfect number of the form $2^n+1$ or $n^n+1$.

数论 · 数学 2020-10-20 Tomohiro Yamada

We prove that a graph $G$ contains no induced $5$-vertex path and no induced complement of a $5$-vertex path if and only if $G$ is obtained from $5$-cycles and split graphs by repeatedly applying the following operations: substitution,…

There are no primes $p$ with $5<p<10^{9}$ for which $2!, 3!, \ldots, (p-1)!$ are all distinct modulo $p$; it is conjectured that there are no such primes.

数论 · 数学 2015-07-02 Tim Trudgian

Subsystem codes are a generalization of noiseless subsystems, decoherence free subspaces, and quantum error-correcting codes. We prove a Singleton bound for GF(q)-linear subsystem codes. It follows that no subsystem code over a prime field…

量子物理 · 物理学 2009-11-13 Andreas Klappenecker , Pradeep Kiran Sarvepalli

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and…

信息论 · 计算机科学 2017-04-13 A. Melakhessou , K. Guenda , T. A. Gulliver , M. Shi , P. Solé

In this paper we prove that there are no hyperelliptic supersingular curves over F_2bar of genus 2^n-1 for any integer n>1. Let g be a natural number, and h=floor(log_2(g+1)+1). Let X be a hyperelliptic curve over F_2bar of genus g>2 and…

代数几何 · 数学 2007-05-23 Jasper Scholten , Hui June Zhu

We solve the problem of the classification of perfect quantum codes. We prove that the only nontrivial perfect quantum codes are those with the parameters . There exist no other nontrivial perfect quantum codes.

量子物理 · 物理学 2009-07-05 Zhuo Li , Lijuan Xing

In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD$(n,2)$ over $\mathbb{F}_3$ and $\mathbb{F}_4$. We…

信息论 · 计算机科学 2021-01-22 Binbin Pang , Shixin Zhu , Xiaoshan Kai

In this note we show that there are no real configurations of $d\geq 4$ lines in the projective plane such that the associated Kummer covers of order $3^{d-1}$ are ball-quotients and there are no configurations of $d\geq 4$ lines such that…

代数几何 · 数学 2023-04-20 Jürgen Bokowski , Piotr Pokora

In this paper, we determine all self-dual codes over $F_p+vF_p$ ($v^2=v$) in terms of self-dual codes over the finite field $F_p$ and give an explicit construction for self-dual codes over $F_p+vF_p$, where $p$ is a prime.

信息论 · 计算机科学 2013-04-18 Guanghui Zhang , Bocong Chen

We study cyclic codes with arbitrary length over Fp+vFp where theta(v)=av, a in Fp and v^2=0. We characterize all existing codes in case of O(theta)|n by using certain projections from (Fp+vFp)[x;theta] to Fp[x]. We provide an explicit…

环与代数 · 数学 2016-07-06 Reza Dastbasteh , Seyyed Hamed Mousavi , Javad Haghighat

This paper gives new methods of constructing {\it symmetric self-dual codes} over a finite field $GF(q)$ where $q$ is a power of an odd prime. These methods are motivated by the well-known Pless symmetry codes and quadratic double circulant…

信息论 · 计算机科学 2021-02-18 Whan-Hyuk Choi , Jon-Lark Kim

In this work we prove that the 5-qubit quantum error correcting code does not fix qubit independent errors, even assuming that the correction circuit does not introduce new errors. We say that a quantum code does not fix a quantum computing…

量子物理 · 物理学 2021-04-14 J. Lacalle , L. M. Pozo-Coronado , A. L. Fonseca de Oliveira , R. Martín-Cuevas

For $k \ge 2$ and a positive integer $d_0$, we show that if there exists no quaternary Hermitian linear complementary dual $[n,k,d]$ code with $d \ge d_0$ and Hermitian dual distance greater than or equal to $2$, then there exists no…

信息论 · 计算机科学 2021-04-16 Keita Ishizuka , Ken Saito

We show that the generalized Fermat equations with signatures (5,5,7), (5,5,19), and (7,7,5) (and unit coefficients) have no non-trivial primitive integer solutions. Assuming GRH, we also prove the nonexistence of non-trivial primitive…

数论 · 数学 2014-01-28 Sander R. Dahmen , Samir Siksek

A maximal curve over a finite field $\mathbb F_q$ is a curve whose number of points reaches the upper Hasse-Weil-Serre bound. We define the discriminant of $\mathbb F_q$ as $d(\mathbb F_q):= \lfloor2\sqrt{q}\rfloor^2-4q$, which arises as…