English
Related papers

Related papers: Some new results on the self-dual [120,60,24] code

200 papers

A code is called transitive if its automorphism group (the isometry group) of the code acts transitively on its codewords. If there is a subgroup of the automorphism group acting regularly on the code, the code is called propelinear. Using…

Combinatorics · Mathematics 2014-11-12 I. Yu. Mogilnykh , F. I. Solov'eva

We classify the possible discrete (finite) symmetries of two--dimensional critical models described by unitary minimal conformally invariant theories. We find that all but six models have the group Z_2 as maximal symmetry. Among the six…

High Energy Physics - Theory · Physics 2009-10-31 P. Ruelle , O. Verhoeven

The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack…

Information Theory · Computer Science 2020-11-25 Shiyuan Qiang , Xiaoyan Jing , Minghui Yang

Extremal problems involving independent sets are much studied. Two of the most important extremal problems in this context are concerned with the sharp upper bounds for the number of independent sets of fixed size and the independence…

Combinatorics · Mathematics 2022-03-22 Kristina Dedndreaj

Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…

Information Theory · Computer Science 2020-03-18 Yansheng Wu , Yoonjin Lee

In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\theta|)=1$ and for some cases when $(n,|\theta|)>1,$ where $n$ is the length of the code and $|\theta|$ is the order of…

Information Theory · Computer Science 2017-05-18 Irwansyah , Intan Muchtadi-Alamsyah , Ahmad Muchlis , Aleams Barra , Djoko Suprijanto

In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12] self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two added to the one…

Information Theory · Computer Science 2017-04-06 Alexander Zhdanov

The purpose of this paper is two-fold. First, we characterize the existence of binary self-orthogonal codes meeting the Griesmer bound by employing Solomon-Stiffler codes and some related residual codes. Second, using such a…

Information Theory · Computer Science 2023-03-30 Minjia Shi , Shitao Li , Tor Helleseth , Jon-Lark Kim

The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…

Information Theory · Computer Science 2020-07-31 Minghui Yang , Keqin Feng

In this paper, we prove that finite groups with semidihedral Sylow 2-subgroup have Class-preserving Coleman outer automorphism group of odd order. As a consequence, these groups satisfy the normalizer problem. In particular, we extend some…

Group Theory · Mathematics 2026-03-10 Riccardo Aragona

A concrete family of automorphisms alpha_n of the free group F_n is exhibited, for any n > 2, and the following properties are proved: alpha_n is irreducible with irreducible powers, has trivial fixed subgroup, and has 2n-1 attractive as…

Group Theory · Mathematics 2009-04-10 Andre Jaeger , Martin Lustig

Starting from a generalization of a recent result on self-duality we systematically analyze self-dual models. We find a criterion to judge whether a given model is self-dual or not. With this tool we construct some new self-dual pairs,…

High Energy Physics - Theory · Physics 2009-10-30 Andreas Karch

A conjecture of Berkovich asserts that every non-simple finite p-group has a non-inner automorphism of order p. This conjecture is far from being proved despite the great effort devoted to it. In this paper we prove it for p-groups of…

Group Theory · Mathematics 2013-01-03 Yassine Guerboussa , Miloud Reguiat

We give a bound on the number of weighted real forms of a complex variety with finite automorphism group, where the weight is the inverse of the number of automorphisms of the real form. We give another bound involving the Sylow 2-subgroup…

Algebraic Geometry · Mathematics 2026-05-27 Gerard van der Geer , Xun Yu

For a curve $X$ of genus $>1$ defined over a finite field, we present a criterion which allows us to state the non existence of automorphisms of order a power of a rational prime. We show how this criterion can be used to determine the…

Number Theory · Mathematics 2016-02-22 Josep González

All four invariants of the mutual-visibility problem and, all four invariants of the general position problem are determined for glued binary trees. The number of the corresponding extremal sets is obtained in each of the eight situations.…

Combinatorics · Mathematics 2025-12-10 Dhanya Roy , Sandi Klavžar , Aparna Lakshmanan S

We study finite groups $G$ such that the maximum length of an orbit of the natural action of the automorphism group $\operatorname{Aut}(G)$ on $G$ is bounded from above by a constant. Our main results are the following: Firstly, a finite…

Group Theory · Mathematics 2019-10-25 Alexander Bors

A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…

Information Theory · Computer Science 2021-08-18 Liren Lin , Yun Fan

This paper investigates the controllability of systems governed by conformable fractional order derivatives. It first establishes the existence and uniqueness of evolution operators for non-autonomous fractional-order homogeneous systems,…

Optimization and Control · Mathematics 2025-02-11 Dev Prakash Jha , Raju K George

We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any…

Information Theory · Computer Science 2017-09-22 Alp Bassa , Henning Stichtenoth