English
Related papers

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

200 papers

Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…

Information Theory · Computer Science 2020-12-10 Cem Güneri , San Ling , Buket Özkaya

Double circulant codes of length $2n$ over the semilocal ring $R = \mathbb{F}_q + u\mathbb{F}_q,\, u^2=u,$ are studied when $q$ is an odd prime power, and $-1$ is a square in $\mathbb{F}_q.$ Double negacirculant codes of length $2n$ are…

Information Theory · Computer Science 2018-06-11 Minjia Shi , Hongwei Zhu , Liqin Qian , Lin Sok , Patrick Solé

We give a uniform asymptotic bound for the number of zeros of complete Abelian integrals in domains bounded away from infinity and the singularities.

Dynamical Systems · Mathematics 2007-05-23 Alexei Grigoriev

We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration…

Information Theory · Computer Science 2016-03-17 Jean-Claude Belfiore , Cem Güneri , Buket Özkaya

Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…

Information Theory · Computer Science 2012-10-23 Finley Freibert , Jon-Lark Kim

Hermitian linear complementary dual codes are linear codes whose intersection with their Hermitian dual code is trivial. The largest minimum weight among quaternary Hermitian linear complementary dual codes of dimension $2$ is known for…

Combinatorics · Mathematics 2020-04-21 Keita Ishizuka

We characterize all linear $q$-ary completely regular codes with covering radius $\rho=2$ when the dual codes are antipodal. These completely regular codes are extensions of linear completely regular codes with covering radius 1, which are…

Information Theory · Computer Science 2010-02-25 Joaquim Borges , Josep Rifa , Victor Zinoviev

Motivated by Xing's method [7], we show that there exist [n,k,d] linear Hermitian codes over F_{q^2} with k+d>=n-3 for all sufficiently large q. This improves the asymptotic bound of Algebraic-Geometry codes from Hermitian curves given in…

Algebraic Geometry · Mathematics 2007-09-14 Siman Yang

There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…

Information Theory · Computer Science 2021-06-15 Minjia Shi , Shukai Wang , Jon-Lark Kim , Patrick Solé

In this paper we characterize the algebraic structure of two-dimensional $(\alpha,\beta )$-constacyclic codes of arbitrary length $s.\ell$ and of their duals. For $\alpha,\beta \in \{1,-1\}$, we give necessary and sufficient conditions for…

Information Theory · Computer Science 2020-07-30 Swati Bhardwaj , Madhu Raka

A flag $C_0 \subsetneq C_1 \cdots \subsetneq C_s \subsetneq {\mathbb F}_q^n $ of linear codes is said to be self-orthogonal if the duals of the codes in the flag satisfy $C_{i}^\perp=C_{s-i}$, and it is said to satisfy the isometry-dual…

Information Theory · Computer Science 2024-06-14 Maria Bras-Amorós , Alonso S. Castellanos , Luciane Quoos

We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes.

Information Theory · Computer Science 2010-04-08 Kenza Guenda

A $G$-grading on a complex semisimple Lie algebra $L$, where $G$ is a finite abelian group, is called quasi-good if each homogeneous component is 1-dimensional and 0 is not in the support of the grading. Analogous to classical root systems,…

Group Theory · Mathematics 2014-10-30 Gang Han , Kang Lu , Jun Yu

Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. We give a characterization of LCD codes over $\mathbb{F}_q$ having large minimum weights for $q \in \{2,3\}$. Using the characterization, we…

Combinatorics · Mathematics 2021-01-05 Makoto Araya , Masaaki Harada , Ken Saito

We count integral quaternion zeros of $\gamma_1^2 \pm \dots \pm \gamma_n^2$, giving an asymptotic when $n\ge 9$, and a likely near-optimal bound when $n=8$. To do so, we introduce a new, nonabelian delta symbol method, which is of…

Number Theory · Mathematics 2024-07-22 Nuno Arala , Jayce R. Getz , Jiaqi Hou , Chun-Hsien Hsu , Huajie Li , Victor Y. Wang

We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R=1/2, by our constructive lower bound,…

Information Theory · Computer Science 2015-05-13 Yang Ding

Let $F$ be a non-degenerate quadratic form on an $n$-dimensional vector space $V$ over the rational numbers. One is interested in counting the number of zeros of the quadratic form whose coordinates are restricted in a smoothed box of size…

Number Theory · Mathematics 2019-11-01 Thomas Huong Tran

In this paper, we present a general method for constructing finite-dimensional quasi-Hopf algebras from finite abelian groups and braided vector spaces of Cartan type. The study of such quasi-Hopf algebras leads to the classification of…

Quantum Algebra · Mathematics 2017-06-27 Yuping Yang , Yinhuo Zhang

In this paper, we characterize quasi-integrable modules, of nonzero level, over twisted affine Lie superalgebras. We show that quasi-integrable modules are not necessarily highest weight modules. We prove that each quasi-integrable module…

Representation Theory · Mathematics 2022-02-02 Malihe Yousofzadeh

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…

Information Theory · Computer Science 2016-01-27 Can Xiang , Chunming Tang , Keqin Feng
‹ Prev 1 4 5 6 7 8 10 Next ›