English
Related papers

Related papers: A Note on Linear Complementary Pairs of Group Code…

200 papers

In this paper, we show that a $D$-type map $\Phi_D:M_n\rightarrow M_n$ with $D=(n-2)I_n+P_{\pi_1}+P_{\pi_2}$ induced by a pair $\{\pi_1,\pi_2\}$ of permutations of $(1,2,..., n)$ is positive if $\{\pi_1,\pi_2\}$ has property (C). The…

Quantum Physics · Physics 2013-04-16 Haili Zhao , Jinchuan Hou

We prove that the double covers of the alternating and symmetric groups are determined by their complex group algebras. To be more precise, let $n\geq 5$ be an integer, $G$ a finite group, and let $\AAA$ and $\SSS^\pm$ denote the double…

Representation Theory · Mathematics 2016-01-20 Christine Bessenrodt , Hung Ngoc Nguyen , Jørn B. Olsson , Hung P. Tong-Viet

Two submatrices $A,D$ of a Hadamard matrix $H$ are called complementary if, up to a permutation of rows and columns, $H=[^A_C{\ }^B_D]$. We find here an explicit formula for the polar decomposition of $D$. As an application, we show that…

Combinatorics · Mathematics 2014-03-24 Teo Banica , Ion Nechita , Jean-Marc Schlenker

We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…

Information Theory · Computer Science 2022-09-29 Angelo Marotta

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada , Ken Saito

In recent years, linear complementary pairs (LCP) of codes and linear complementary dual (LCD) codes have gained significant attention due to their applications in coding theory and cryptography. In this work, we construct explicit LCPs of…

Algebraic Geometry · Mathematics 2024-12-31 Alonso S. Castellanos , Adler V. Marques , Luciane Quoos

Given a finite group $G$ and an extension of finite chain rings $S|R$, one can consider the group rings $\mathscr{S} = S[G]$ and $\mathscr{R} = R[G]$. The group ring $\mathscr{S}$ can be viewed as an $R$-bimodule, and any of its…

Information Theory · Computer Science 2025-08-12 Maryam Bajalan , Javier de la Cruz , Alexandre Fotue Tabue , Edgar Martínez-Moro

Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…

Information Theory · Computer Science 2017-03-10 Adel Alahmadi , Cem Güneri , Buket Özkaya , Hatoon Shoaib , Patrick Solé

In this paper, we provide a polynomial characterization of linear complementary pairs of quasi-cyclic and quasi-twisted codes of index 2. We also give several examples of linear complementary pairs of quasi-cyclic and quasi-twisted codes…

Information Theory · Computer Science 2026-01-21 Kanat Abdukhalikov , Duy Ho , San Ling , Gyanendra K. Verma

We continue our study of the class $\mathscr{C}(D)$, where $D$ is a uniform ultrafilter on a cardinal $\kappa$ and $\mathscr{C}(D)$ is the class of all pairs $(\theta_1, \theta_2),$ where $(\theta_1, \theta_2)$ is the cofinality of a cut in…

Logic · Mathematics 2017-12-19 Mohammad Golshani , Saharon Shelah

We show that for $n \ge 6$ every even permutation on $n$ symbols is the commutator of two $n$-cycles. More precisely, let $S_n$ be the symmetric group and $A_n$ the alternating group. Let $C(n) \subset S_n$ denote the conjugacy class of…

Group Theory · Mathematics 2025-10-14 Philipp Bader

Let $(G,N)$ be a pair of groups. In this article, first we construct a relative central extension for the pair $(G,N)$ such that special types of covering pair of $(G,N)$ are homomorphic image of it. Second, we show that every perfect pair…

Group Theory · Mathematics 2016-10-04 Azam Pourmirzaei , Mitra Hassanzadeh , Behrooz Mashayekhy

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Information Theory · Computer Science 2021-11-11 Martino Borello , Wolfgang Willems

Let $A$ and $B$ be subsets of a finite group $G$ and $r$ a positive integer. If for every $g\in G$, there are precisely $r$ pairs $(a,b)\in A\times B$ such that $g=ab$, then $B$ is called a code in $G$ with respect to $A$ and we write $r…

Combinatorics · Mathematics 2025-12-23 Teng Fang , Jinbao Li

Generalizing the linear complementary duals, the linear complementary pairs and the hull of codes, we introduce the concept of $\ell$-dimension linear intersection pairs ($\ell$-DLIPs) of codes over a finite commutative ring $(R)$, for some…

Information Theory · Computer Science 2023-06-22 Sanjit Bhowmick , Alexandre Fotue Tabue , Joydeb Pal

We study pairs (C,D) of unital C*-algebras where D is a regular abelian C*-subalgebra of C. When D is a MASA in C, we prove the existence and uniqueness of a completely positive unital map E of C into the injective envelope I(D) of D whose…

Operator Algebras · Mathematics 2012-04-10 David R. Pitts

Additive codes have attracted considerable attention for their potential to outperform linear codes. However, distinguishing strictly additive codes from those that are equivalent to linear codes remains a fundamental challenge. To resolve…

Information Theory · Computer Science 2026-03-17 Kanat Abdukhalikov , Duy Ho

An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…

Commutative Algebra · Mathematics 2025-05-06 Marie Amalore Nambi , Neeraj Kumar

We characterize Product-MDS pairs of linear codes, i.e.\ pairs of codes $C,D$ whose product under coordinatewise multiplication has maximum possible minimum distance as a function of the code length and the dimensions $\dim C, \dim D$. We…

Information Theory · Computer Science 2015-08-21 Diego Mirandola , Gilles Zémor

Bazzi and Mitter [3] showed that binary dihedral group codes are asymptotically good. In this paper we prove that the dihedral group codes over any finite field with good mathematical properties are asymptotically good. If the…

Information Theory · Computer Science 2021-07-05 Yun Fan , Liren Lin