English
Related papers

Related papers: Linear complementary pair of group codes over fini…

200 papers

We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…

Information Theory · Computer Science 2007-11-01 Paul Hurley , Ted Hurley

We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in…

Information Theory · Computer Science 2010-12-30 Somphong Jitman , San Ling , Hongwei Liu , Xiaoli Xie

The projective general linear group $\mathrm{PGL}_2(\mathrm{GF}(2^m))$ acts as a $3$-transitive permutation group on the set of points of the projective line. The first objective of this paper is to prove that all linear codes over…

Information Theory · Computer Science 2020-10-20 Cunsheng Ding , Chunming Tang , Vladimir D. Tonchev

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

In this paper, we give an important isomorphism between contacyclic codes and cyclic codes over finite principal ideal rings. Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal…

Information Theory · Computer Science 2015-05-06 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

A popular account of the mixing patterns for the three generations of quarks and leptons is through the characters $\kappa$ of a finite group $G$. Here we introduce a $d$-dimensional Hilbert space with $d=cc(G)$, the number of conjugacy…

High Energy Physics - Phenomenology · Physics 2020-06-19 Michel Planat , Raymond Aschheim , Marcelo M. Amaral , Klee Irwin

A coding lattice $\Lambda_c$ and a shaping lattice $\Lambda_s$ forms a nested lattice code $\mathcal{C}$ if $\Lambda_s \subseteq \Lambda_c$. Under some conditions, $\mathcal{C}$ is a finite cyclic group formed by rectangular encoding. This…

Information Theory · Computer Science 2024-05-10 Chengpin Luo , Brian M. Kurkoski

Let $E$ be an elliptic curve with complex multiplication by a ring $R$, where $R$ is an order in an imaginary quadratic field or quaternion algebra. We define sesquilinear pairings ($R$-linear in one variable and $R$-conjugate linear in the…

Number Theory · Mathematics 2025-10-14 Katherine E. Stange

Given a finite group $G$ with identity $e$ and a normal subgroup $H$ of $G$, the subgroup sum graph $\Gamma_{G,H}$ (resp. extended subgroup sum graph $\Gamma_{G,H}^+$) of $G$ with respect to $H$ is the graph with vertex set $G$, in which…

Combinatorics · Mathematics 2024-12-24 Xuanlong Ma , Yuefeng Yang , Liangliang Zhai

We classify algebraic curves in $\mathbb{CP}^{n}$ ($n \geq 2$) that are invariant under an infinite subgroup of $\operatorname{PGL}(n+1,\mathbb{C})$. In particular, we prove that any irreducible, non-degenerate, one-dimensional algebraic…

Algebraic Geometry · Mathematics 2025-05-02 Angel Cano , Luis Loeza , Rodrigo Dávila Figueroa

This article explores a new type of nonlinear complementarity problem, namely the horizontal tensor complementarity problem (HTCP), which is a natural extension of the horizontal linear complementarity problem studied in [12]. We extend the…

Optimization and Control · Mathematics 2023-12-05 Punit Kumar Yadav , Sonali Sharma , K. Palpandi

The hull $H(C)$ of a linear code $C$ is defined by $H(C)=C \cap C^\perp$. A linear code with a complementary dual (LCD) is a linear code with $H(C)=\{0\}$. The dimension of the hull of a code is an invariant under permutation equivalence.…

Information Theory · Computer Science 2018-09-17 Ruud Pellikaan

Let G be a linear group such that for every g in G there is a finite set R(g) with the property that for every x in G all sufficiently long commutators [g,x,x,...,x] belong to R(g). It is proved that G is finite-by-hypercentral.

Group Theory · Mathematics 2019-07-10 Pavel Shumyatsky

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

The upper ideal relation graph $\Gamma_{U}(R)$ of a commutative ring $R$ with unity is a simple undirected graph with the set of all non-unit elements of $R$ as a vertex set and two vertices $x$, $y$ are adjacent if and only if the…

Combinatorics · Mathematics 2024-05-30 Mohd Shariq , Praveen Mathil , Jitender Kumar

Let D be a division ring such that the number of conjugacy classes in the multiplicative group D^* is equal to the power of D^*. Suppose that H(V) is the group GL(V) or PGL(V), where V is an infinite-dimensional vector space over D. We…

Logic · Mathematics 2011-12-13 Vladimir Tolstykh

Let $K$ be an algebraic number field with ring of integers $\Cal{O}_{K}$, $p>2$ be a rational prime and $G$ be the cyclic group of order $p $. Let $\Lambda$ denote the order $\Cal{O}_{K}[G].$ Let $Cl(\Lambda)$ denote the locally free class…

Number Theory · Mathematics 2007-05-23 Daniel R. Replogle

Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $\pi_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|\pi_e(G)|+k$. We call such groups to be $co(k)$…

Group Theory · Mathematics 2007-05-23 Xianglin Du , Wujie Shi

Irreducible representations (irreps) of a finite group $G$ are equivalent if there exists a similarity transformation between them. In this paper, we describe an explicit algorithm for constructing this transformation between a pair of…

Representation Theory · Mathematics 2015-06-19 Marek Mozrzymas , Michał Studziński , Michał Horodecki

Partitions of the binary linear Hamming code into Preparata-like codes are known to induce line-parallelisms of PG$(n, 2)$. In this paper, we show that if $P$ is any Preparata-like code contained in the binary linear Hamming code $H$ of the…

Combinatorics · Mathematics 2025-08-28 Philipp Heering , Vladislav Taranchuk
‹ Prev 1 4 5 6 7 8 10 Next ›