English
Related papers

Related papers: $\mathbb{Z}_p\mathbb{Z}_{p^2}\dots\mathbb{Z}_{p^s}…

200 papers

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

Information Theory · Computer Science 2016-12-06 Jin Li , Aixian Zhang , Keqin Feng

We introduce a class of novel $\mathbb{Z}_2 \times \mathbb{Z}_2$-graded color superalgebras of infinite dimension. It is done by realizing each member of the class in the universal enveloping algebra of a Lie superalgebra which is a module…

Mathematical Physics · Physics 2020-07-09 N. Aizawa , P. S. Isaac , J. Segar

We determine explicitly the Gauss sums on the general linear group $GL_2(\mathbb{Z}/p^l\mathbb{Z})$ for all irreducible characters, where $p$ is an odd prime and $l$ is an integer > 1. While there are several studies of the Gauss sums on…

Representation Theory · Mathematics 2013-03-22 Taiki Maeda

In this paper, we study self-dual codes over $\mathbb{Z}_2 \times (\mathbb{Z}_2+u\mathbb{Z}_2) $, where $u^2=0$. Three types of self-dual codes are defined. For each type, the possible values $\alpha,\beta$ such that there exists a code…

Information Theory · Computer Science 2016-10-05 Long Yu , Qiong Huang , Hongwei Liu , Xiusheng Liu

A $(G,[k_1,\dots,k_t],\lambda)$ {\it partitioned difference family} (PDF) is a partition $\cal B$ of an additive group $G$ into sets ({\it blocks}) of sizes $k_1$, \dots, $k_t$, such that the list of differences of ${\cal B}$ covers exactly…

Combinatorics · Mathematics 2023-07-20 Anamari Nakic

This paper investigates the existence, enumeration and asymptotic performance of self-dual and LCD double circulant codes over Galois rings of characteristic $p^2$ and order $p^4$ with $p$ and odd prime. When $p \equiv 3 \pmod{4},$ we give…

Information Theory · Computer Science 2018-01-23 Minjia Shi , Daitao Huang , Lin Sok , Patrick Solé

Let C be an additive subgroup of $\Z_{2k}^n$ for any $k\geq 1$. We define a Gray map $\Phi:\Z_{2k}^n \longrightarrow \Z_2^{kn}$ such that $\Phi(\codi)$ is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover,…

Information Theory · Computer Science 2009-07-31 J. Borges , C. Fernandez-Cordoba , J. Rifa

Let $A$ be a finite subset of $L^2(\mathbb{R})$ and $p,q\in\mathbb{N}$. We characterize the Schauder basis properties in $L^2(\mathbb{R})$ of the Gabor system $$G(1,p/q,A)=\{e^{2\pi i m x}g(x-np/q) : m,n\in \mathbb{Z}, g\in A\},$$ with a…

Functional Analysis · Mathematics 2015-01-26 Morten Nielsen

A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer…

Data Structures and Algorithms · Computer Science 2007-05-23 Anatoly Rodionov , Sergey Volkov

The mathematical basis of p-adic Higgs mechanism discussed in papers [email protected] 9410058-62 is considered in this paper. The basic properties of p-adic numbers, of their algebraic extensions and the so called canonical…

High Energy Physics - Theory · Physics 2008-02-03 M. Pitkänen

A Z2Z4-additive code C is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z_2 and the set of Z_4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant.…

Information Theory · Computer Science 2017-07-12 J. Borges , S. T. Dougherty , C. Fernández-Córdoba , R. Ten-Valls

If $N=2^k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of…

Information Theory · Computer Science 2008-05-10 Denis Krotov

We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…

Combinatorics · Mathematics 2018-04-10 Juergen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

Let $\Bbbk$ be an algebraically closed field of characteristic $p>0$. We study the general structures of $p^n$-dimensional Hopf algebras over $\Bbbk$ with $p^{n-1}$ group-like elements or a primitive element generating a…

Quantum Algebra · Mathematics 2023-08-22 Siu-Hung Ng , Xingting Wang

In this paper, we introduce a new definitions of the Gray weight and the Gray map for linear codes over $\mathbb{Z}_9+u\mathbb{Z}_9$ with $u^2=u$. Some results on self-dual codes over this ring are investigated. Further, the structural…

Information Theory · Computer Science 2015-01-05 Jian Gao , XianFang Wang , Fang-Wei Fu

Expanded Blaum-Roth (EBR) codes consist of $n\times n$ arrays such that lines of slopes $i$, $0\leq i\leq r-1$ for $2\leq r<n$, as well as vertical lines, have even parity. The codes are MDS with respect to columns, i.e., they can recover…

Information Theory · Computer Science 2021-04-15 Mario Blaum

In this paper we study Z2Z4Z8-additive codes, which are the extension of recently introduced Z2Z4-additive codes. We determine the standard forms of the generator and parity-check matrices of Z2Z4Z8-additive codes. Moreover, we investigate…

Information Theory · Computer Science 2017-04-25 Ismail Aydogdu , Fatmanur Gursoy

Let $p$ be a prime number and $\mathbb{Z}_p=\mathbb{Z}/p\mathbb{Z}$. We study finite groups with abelian derived subgroup and exponent $p$ in terms of group extension data and their matrix presentations. We show a one-to-one correspondence…

Group Theory · Mathematics 2020-03-31 Zheyan Wan , Yu Ye , Chi Zhang

Let $m\geq 2$ be any natural number and let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+\cdots+u^{m-1}\mathbb{F}_{p}$ be a finite non-chain ring, where $u^m=u$ and $p$ is a prime congruent to $1$ modulo $(m-1)$. In this…

Number Theory · Mathematics 2016-09-27 Mokshi Goyal , Madhu Raka

We consider polynomial codes for private distributed matrix multiplication (PDMM/SDMM). Existing codes for PDMM are either specialized for the outer product partitioning (OPP), or inner product partitioning (IPP), or are valid for the more…

Information Theory · Computer Science 2026-01-27 Christoph Hofmeister , Razane Tajeddine , Antonia Wachter-Zeh , Rawad Bitar