English
Related papers

Related papers: Self-dual $2$-quasi-abelian Codes

200 papers

In this paper, a criterion of MDS Euclidean self-orthogonal codes is presented. New MDS Euclidean self-dual codes and self-orthogonal codes are constructed via this criterion. In particular, among our constructions, for large square $q$,…

Information Theory · Computer Science 2019-10-01 Xiaolei Fang , Meiqing Liu , Jinquan Luo

Abelian groups having partial orderings compatible with their binary operations have long been studied in the literature. In particular, lattice-ordered abelian groups constitute a universal-algebraic variety, and thus form a category which…

Rings and Algebras · Mathematics 2012-01-25 Elijah Stines

We construct a 2-category of differential graded schemes. The local affine models in this theory are differential graded algebras, which are graded commutative with unit over a field of characteristic zero, are concentrated in non-positive…

Algebraic Geometry · Mathematics 2007-05-23 Kai Behrend

We show that any compact half-conformally flat manifold of negative type, with bounded $L^2$ energy, sufficiently small scalar curvature, and a non-collapsing assumption, has all betti numbers bounded. We show that this result is optimal…

Differential Geometry · Mathematics 2019-07-23 Brian Weber , Martin Citoler-Saumell

The existence of optimal binary self-dual codes is a long-standing research problem. In this paper, we present some results concerning the decomposition of binary self-dual codes with a dihedral automorphism group $D_{2p}$, where $p$ is a…

Information Theory · Computer Science 2014-05-30 Tao Zhang , Jerod Michel , Tao Feng , Gennian Ge

We prove that for every field k and every positive integer n, there exists an absolutely simple n-dimensional abelian variety over k. We also prove an asymptotic result for finite fields: For every finite field k and positive integer n, we…

Algebraic Geometry · Mathematics 2007-05-23 Everett W. Howe , Hui June Zhu

Linear complementary dual codes (LCD) intersect trivially with their dual. In this paper, we develop a new characterization for LCD codes, which allows us to judge the complementary duality of linear codes from the codeword level. Further,…

Information Theory · Computer Science 2023-07-10 Chaofeng Guan , Ruihu Li , Zhi Ma

In this work, new construction methods for self-dual codes are given. The methods use the short Kharaghani array and a variation of it. These are applicable to any commutative Frobenius ring. We apply the constructions over the ring F_2 +…

Combinatorics · Mathematics 2016-02-24 Abidin Kaya

Quasi-abelian categories are abundant in functional analysis and representation theory. It is known that a quasi-abelian category $\mathcal{E}$ is a cotilting torsionfree class of an abelian category. In fact, this property characterizes…

Category Theory · Mathematics 2024-08-06 Ruben Henrard , Sondre Kvamme , Adam-Christiaan van Roosmalen , Sven-Ake Wegner

We classify all linear completely regular codes which have covering radius $\rho = 2$ and whose dual are antipodal. For this, we firstly show several properties of such dual codes, which are two-weight codes.

Information Theory · Computer Science 2023-02-22 J. Borges , D. V. Zinoviev , V. A. Zinoviev

It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…

Quantum Physics · Physics 2007-05-23 Eric M. Rains

We study the classification of minimal codewords of projective Reed-Muller codes of order $2$. This problem is equivalent to identifying quadrics over finite fields whose set of rational points is maximal with respect to the inclusion. We…

Information Theory · Computer Science 2026-04-21 Alain Couvreur , Rati Ludhani

In this work we investigate the problem of producing iso-dual algebraic geometry (AG) codes over a finite field $\mathbb{F}_q$ with $q$ elements. Given a finite separable extension $\mathcal{M}/\mathcal{F}$ of function fields and an…

Information Theory · Computer Science 2026-04-16 María Chara , Ricardo Podestá , Luciane Quoos , Ricardo Toledano

We construct a class of $\mathbb{Z}_2\mathbb{Z}_4$-additive cyclic codes generated by pairs of polynomials, study their algebraic structures, and obtain the generator matrix of any code in the class. Using a probabilistic method, we prove…

Information Theory · Computer Science 2019-11-22 Yun Fan , Hualu Liu

We define admissible and weakly admissible subcategories in exact categories and prove that the former induce semi-orthogonal decompositions on the derived categories. We develop the theory of thin exact categories, an exact-category…

Representation Theory · Mathematics 2024-06-25 Agnieszka Bodzenta , Alexey Bondal

All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.

Combinatorics · Mathematics 2015-03-13 Stefka Bouyuklieva , Nikolay Yankov , Radka Russeva

We provide a characterization of almost ordinary abelian varieties over finite fields, and use this characterization to provide lower bounds for the sizes of some almost ordinary isogeny classes.

Number Theory · Mathematics 2019-11-13 Abhishek Oswal , Ananth N. Shankar

In this note we investigate extremal singly-even self-dual codes with minimal shadow. For particular parameters we prove non-existence of such codes. By a result of Rains \cite{Rains-asymptotic}, the length of extremal singly-even self-dual…

Combinatorics · Mathematics 2012-10-10 Stefka Bouyuklieva , Wolfgang Willems

In this paper, we introduce and investigate the neighborhood of binary self-dual codes. We prove that there is no better Type I code than the best Type II code of the same length. Further, we give some new necessary conditions for the…

Information Theory · Computer Science 2023-01-18 Carolin Hannusch , S. Roland Major

Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…

Information Theory · Computer Science 2022-01-05 Swati Bhardwaj , Madhu Raka