English
Related papers

Related papers: Simplex and MacDonald Codes over $R_{q}$

200 papers

We first define a new Gray map from $R=\mathbb{Z}_4+u\mathbb{Z}_4$ to $\mathbb{Z}^{2}_{4}$, where $u^2=1$ and study $(1+2u)$-constacyclic codes over $R$. Also of interest are some properties of $(1+2u)$-constacyclic codes over $R$.…

Information Theory · Computer Science 2016-12-28 Minjia Shi , Liqing Qian , Lin Sok , Nuh Aydin , Patrick Solé

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

Logic · Mathematics 2019-12-20 Chi Tat Chong , Wei Li , Lu Liu , Yue Yang

We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…

Number Theory · Mathematics 2011-11-11 Noam D. Elkies , Scott Duke Kominers

Let $G$, $G_1$ and $G_2$ be quasi-finite and flat group schemes over a complete discrete valuation ring $R$, $\varphi_1:G\to G_1$ any morphism of $R$-group schemes and $\varphi_2:G\to G_2$ a model map. We construct the pushout $P$ of $G_1$…

Algebraic Geometry · Mathematics 2012-09-19 Marco Antei

In this paper we study two dimensional minimal linear code over the ring $\mathbb{Z}_{p^n}$(where $p$ is prime). We show that if the generator matrix $G$ of the two dimensional linear code $M$ contains $p^n+p^{n-1}$ column vector of the…

Information Theory · Computer Science 2024-03-05 Biplab Chatterjee , Ratnesh Kumar Mishra

Let $R=\mathbb{Z}_{4}[v]/\langle v^2+2v\rangle=\mathbb{Z}_{4}+v\mathbb{Z}_{4}$ ($v^2=2v$) and $n$ be an odd positive integer. Then $R$ is a local non-principal ideal ring of $16$ elements and there is a $\mathbb{Z}_{4}$-linear Gray map from…

Information Theory · Computer Science 2018-03-02 Yuan Cao , Yonglin Cao

We propose and support the possibility that the shape of topological density 2-point function in pure-glue QCD is crucially, and possibly entirely, determined by the space-time folding (geometry) of the double-sheet sign-coherent structure…

High Energy Physics - Lattice · Physics 2010-01-21 Ivan Horvath , Andrei Alexandru , Thomas Streuer

Let $\mathbb{F}_q$ be a finite field of $q=p^m$ elements where $p$ is a prime and $m$ is a positive integer. This paper considers $(\gamma,\Delta)$-cyclic codes over a class of finite non-chain commutative rings…

Information Theory · Computer Science 2025-02-25 Om Prakash , Shikha Patel , Habibul Islam

In the first part of the paper we construct a ring structure on the rational cobordism classes of Morin maps (i. e. smooth generic maps of corank 1). We show that associating to a Morin map its singular strata defines a ring homomorphism to…

Geometric Topology · Mathematics 2014-10-01 Gabor Lippner , Andras Szucs

A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…

Information Theory · Computer Science 2020-10-26 Simon Eisenbarth , Sihuang Hu

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

Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{\pi_r:\Sigma\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings from a…

Dynamical Systems · Mathematics 2007-07-16 Atsushi Kameyama

Let $p$ be a prime number and $\varsigma$ and $m$ be a positive integers. Let $\mathcal{R} = \mathbb{F}_{2^m} + u\mathbb{F}_{2^m} + u^2\mathbb{F}_{2^m}$ ($u^3 = 0$). Cyclic codes of length $2^\varsigma$ over $\mathcal{R}$ are precisely the…

Combinatorics · Mathematics 2025-09-05 Divya Acharya , Prasanna Poojary , Vadiraja Bhatta G R

We give a uniform construction of the finite simple groups $E_6(q)$, $F_4(q)$ and ${}^2E_6(q)$, which does not require any special treatment for characteristics 2 or 3, and in particular avoids any mention of quadratic Jordan algebras.…

Group Theory · Mathematics 2013-10-23 Robert A. Wilson

The $2$-to-$1$ mapping over finite fields has a wide range of applications, including combinatorial mathematics and coding theory. Thus, constructions of $2$-to-$1$ mappings have attracted considerable attention recently. Based on…

Information Theory · Computer Science 2025-07-14 Yaqin Li , Kangquan Li , Qiancheng Zhang

Due to their rich algebraic structure, cyclic codes have a great deal of significance amongst linear codes. Duadic codes are the generalization of the quadratic residue codes, a special case of cyclic codes. The $m$-adic residue codes are…

Information Theory · Computer Science 2024-05-28 Ferhat Kuruz , Mustafa Sarı , Mehmet E. Koroglu

The weight distribution and weight hierarchy of linear codes are two important research topics in coding theory. In this paper, by choosing proper defining sets from inhomogeneous quadratic functions over $\mathbb{F}_{q}^{2},$ we construct…

Information Theory · Computer Science 2022-06-17 Fei Li , Xiumei Li

On a regular tetrahedron in spherical space there exist the finite number of simple closed geodesics. For any pair of coprime integers $(p,q)$ it was found the numbers $\alpha_1$ and $\alpha_2$ depending on $p$, $q$ and satisfying the…

Metric Geometry · Mathematics 2021-10-27 Alexander A. Borisenko , Darya D. Sukhorebska

A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…

Information Theory · Computer Science 2021-08-18 Liren Lin , Yun Fan

We present an encoding and decoding scheme for constant weight sequences, that is, given an information sequence, the construction results in a sequence of specific weight within a certain range. The scheme uses a prefix design that is…

Information Theory · Computer Science 2017-06-06 Elie Ngomseu Mambou , Theo G. Swart
‹ Prev 1 8 9 10 Next ›