English
Related papers

Related papers: On Some Classes of $\mathbb{Z}_{2}\mathbb{Z}_{4}-$…

200 papers

For simple algebraic groups defined over algebraically closed fields of good characteristic, we give upper bounds on the covering numbers of unipotent conjugacy classes in terms of their (co)ranks and in terms of their dimensions.

Group Theory · Mathematics 2023-03-31 Iulian Ion Simion

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ where $p$ is an odd prime, $n$ be a positive integer satisfying ${\rm gcd}(n,p)=1$, and denote $R=\mathbb{F}_{p^m}[u]/\langle u^e\rangle$ where $e\geq 4$ be an even integer. Let…

Information Theory · Computer Science 2018-10-09 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Fang-Wei Fu , Jian Gao , Songsak Sriboonchitta

A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter. We show that Delsarte's observation extends to codes over arbitrary…

Combinatorics · Mathematics 2019-05-31 Peter J. Cameron , Josephine Kusuma , Patrick Solé

Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…

Combinatorics · Mathematics 2019-03-07 J. Borges , J. Rifà , V. A. Zinoviev

In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…

Information Theory · Computer Science 2019-04-16 Irwansyah , Intan Muchtadi-Alamsyah , Aleams Barra

We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the exact values for a range of small code lengths. As our main…

Combinatorics · Mathematics 2025-07-14 Alexander Barg , Alexey Glazyrin , Wei-Jiun Kao , Ching-Yi Lai , Pin-Chieh Tseng , Wei-Hsuan Yu

A binary code with covering radius $R$ is a subset $C$ of the hypercube $Q_n=\{0,1\}^n$ such that every $x\in Q_n$ is within Hamming distance $R$ of some codeword $c\in C$, where $R$ is as small as possible. For a fixed coordinate…

Combinatorics · Mathematics 2007-05-23 Robert B. Ellis

In this paper, we study skew constacyclic codes over the ring $\mathbb{Z}_{q}R$ where $R=\mathbb{Z}_{q}+u\mathbb{Z}_{q}$, $q=p^{s}$ for a prime $p$ and $u^{2}=0$. We give the definition of these codes as subsets of the ring…

Information Theory · Computer Science 2018-10-16 Ahlem Melakhessou , Nuh Aydin , Kenza Guenda

Let $R=\mathbb{Z}_4$ be the integer ring mod $4$. A double cyclic code of length $(r,s)$ over $R$ is a set that can be partitioned into two parts that any cyclic shift of the coordinates of both parts leaves invariant the code. These codes…

Information Theory · Computer Science 2015-01-08 Jian Gao , Minjia Shi , Tingting Wu , Fang-Wei Fu

In this paper we derive a closed formula for the $(\mathbb{Z}\times\mathbb{Z}_2)$-graded dimension of the cyclotomic quiver Hecke superalgebra $R^\Lambda(\beta)$ associated to an {\it arbitrary} Cartan superdatum $(A,P,\Pi,\Pi^\vee)$,…

Representation Theory · Mathematics 2021-11-08 Jun Hu , Lei Shi

We prove that a circulant Hadamard code of length $4n$ can always be seen as an HFP-code (Hadamard full propelinear code) of type $C_{4n}\times C_2$, where $C_2=\langle u\rangle$ or the same, as a cocyclic Hadamard code. We compute the rank…

Combinatorics · Mathematics 2017-11-28 Josep Rifà

We present the theory of linear rank-metric codes from the point of view of their fundamental parameters. These are: the minimum rank distance, the rank distribution, the maximum rank, the covering radius, and the field size. The focus of…

Information Theory · Computer Science 2023-12-12 Anina Gruica , Altan B. Kilic , Alberto Ravagnani

This paper is concerned with list decoding of $2$-interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm for (interleaved) Reed-Solomon codes and an algorithm for…

Information Theory · Computer Science 2022-02-14 Chih-Chiang Huang , Hedongliang Liu , Lukas Holzbaur , Sven Puchinger , Antonia Wachter-Zeh

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…

Number Theory · Mathematics 2008-08-18 Lenny Fukshansky

We point out a gap in the proof of the Davis--Januszkiewicz theorem on cohomology of small covers of simple polytopes, and give a correction to this proof. We use this theorem to compute explicitly the Betti numbers for a wide class of…

Algebraic Topology · Mathematics 2017-09-21 Dmitry Ulyumdzhiev

In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an…

Information Theory · Computer Science 2009-06-23 Maximilien Gadouleau , Zhiyuan Yan

In this paper, we determine the covering radius and a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient condition for deciding whether a word is not a deep hole…

Information Theory · Computer Science 2018-09-11 Weijun Fang , Li-Ping Wang , Daqing Wan

This paper is devoted to establishing the kernel theorems for $\alpha$-modulation spaces in terms of boundedness and compactness. We characterize the boundedness of a linear operator $A$ from an $\alpha$-modulation space…

Functional Analysis · Mathematics 2024-10-01 Guoping Zhao , Weichao Guo

The paper is devoted to the classification of entire solutions to the Cahn-Hilliard equation $-\Delta u = u-u^3-\delta$ in $\R^N$, with particular interest in those solutions whose nodal set is either bounded or contained in a cylinder. The…

Analysis of PDEs · Mathematics 2019-02-04 Matteo Rizzi

A new generalization of the Gray map is introduced. The new generalization $\Phi: Z_{2^k}^n \to Z_{2}^{2^{k-1}n}$ is connected with the known generalized Gray map $\phi$ in the following way: if we take two dual linear $Z_{2^k}$-codes and…

Combinatorics · Mathematics 2009-10-05 Denis Krotov