English
Related papers

Related papers: On self-dual double negacirculant codes

200 papers

Ternary self-dual codes have been classified for lengths up to 20. At length 24, a classification of only extremal self-dual codes is known. In this paper, we give a complete classification of ternary self-dual codes of length 24 using the…

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Akihiro Munemasa

In this work, quadratic reside codes over the ring F2 +uF2 +u^2F2 with u^3 = u are considered. A duality and distance preserving Gray map from F2 + uF2 + u^2F2 to (F_2)^3 is defined. By using quadratic double circulant, quadratic bordered…

Information Theory · Computer Science 2016-02-25 Abidin Kaya , Bahattin Yildiz , Irfan Siap

We derive the U-duality charge orbits, as well as the related moduli spaces, of "large" and "small" extremal black holes in non-maximal ungauged Maxwell-Einstein supergravities with symmetric scalar manifolds in d=5 space-time dimensions.…

High Energy Physics - Theory · Physics 2014-11-21 Bianca L. Cerchiai , Sergio Ferrara , Alessio Marrani , Bruno Zumino

The automorphism group of a binary doubly-even self-dual code is always contained in the alternating group. On the other hand, given a permutation group $G$ of degree $n$ there exists a doubly-even self-dual $G$-invariant code if and only…

Number Theory · Mathematics 2014-02-26 Annika Guenther , Gabriele Nebe

In this paper, we construct a new family of distance-optimal binary cyclic codes with the minimum distance $6$ and a new family of distance-optimal quaternary cyclic codes with the minimum distance $4$. We also construct several families of…

Information Theory · Computer Science 2024-02-15 Hao Chen , Yanan Wu

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

Number Theory · Mathematics 2025-04-25 Jean-Paul Allouche , Manon Stipulanti , Jia-Yan Yao

We generalize the fundamental bounds of Delsarte thesis (1973) on codes of given degree and designs of given strength in the new setting of Bannai et al. (2025). We assume the scheme is weakly metric in the sense of (Sol\'e, 1989). We give…

Combinatorics · Mathematics 2026-05-29 Minjia Shi , Jing Wang , Patrick Solé

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…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

The dual of the Kasami code of length $q^2-1$, with $q$ a power of $2$, is constructed by concatenating a cyclic MDS code of length $q+1$ over $F_q$ with a Simplex code of length $q-1$. This yields a new derivation of the weight…

Information Theory · Computer Science 2023-06-28 Minjia Shi , Denis Krotov , Patrick Solé

We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…

Information Theory · Computer Science 2022-12-16 Heide Gluesing-Luerssen , Alberto Ravagnani

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

Information Theory · Computer Science 2009-01-09 Eric Z. Chen

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

Information Theory · Computer Science 2023-06-27 Hao Chen

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. These codes were first introduced by Massey in 1964. Nowadays, LCD codes are extensively studied in the…

Information Theory · Computer Science 2021-09-15 Stefka Bouyuklieva

Let $k$ be an algebraically closed field of odd characteristic $p$, and let $D_n$ be the dihedral group of order $2n$ such that $p\mid 2n$. Let $D(kD_n)$ denote the quantum double of the group algebra $kD_n$. In this paper, we describe the…

Quantum Algebra · Mathematics 2011-02-08 Jingcheng Dong , Huixiang Chen

We investigate duality properties of N-form fields, provide a symmetric way of coupling them to electric/magnetic sources, and check that these charges obey the appropriate quantization requirements. First, we contrast the D=4k case, in…

High Energy Physics - Theory · Physics 2008-11-26 S. Deser , A. Gomberoff , M. Henneaux , C. Teitelboim

Let $\mathcal{O}$ be a conic in the classical projective plane $PG(2,q)$, where $q$ is an odd prime power. With respect to $\mathcal{O}$, the lines of $PG(2,q)$ are classified as passant, tangent, and secant lines, and the points of…

Combinatorics · Mathematics 2009-11-12 Peter Sin , Junhua Wu , Qing Xiang

The cyclic codes with parity check polynomial the reciprocal of the characteristic polynomial of the Fibonacci recurrence over a prime finite field are shown to have either one weight or two weights. When these codes are irreducible cyclic…

Information Theory · Computer Science 2017-09-15 Minjia Shi , Zhongyi Zhang , Patrick Sole

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum…

Combinatorics · Mathematics 2018-10-10 Peter Beelen , Prasant Singh

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$…

Combinatorics · Mathematics 2023-07-19 Makoto Araya , Masaaki Harada , Vladimir D. Tonchev

A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\perp}$ satisfies $C \cap C^{\perp}$= $\left\{ \mathbf{0}\right\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of…

Information Theory · Computer Science 2017-01-17 Lucky Galvez , Jon-Lark Kim , Nari Lee , Young Gun Roe , Byung-Sun Won
‹ Prev 1 8 9 10 Next ›