English
Related papers

Related papers: Multivariable codes over finite chain rings: semis…

200 papers

Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…

Information Theory · Computer Science 2010-02-25 Diego Ruano

The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths…

Information Theory · Computer Science 2023-06-21 Hao Chen

Let $f(u)$ and $g(v)$ be any two polynomials of degree $k$ and $\ell$ respectively ($k$ and $\ell$ are not both $1$), which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle…

Information Theory · Computer Science 2018-11-06 Mokshi Goyal , Madhu Raka

Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun {\em et al}. Inspired by their work, we present two new constructions of codes over the ring $\Bbb F_2+u\Bbb F_2$…

Information Theory · Computer Science 2019-10-11 Yansheng Wu , Xiaomeng Zhu , Qin Yue

We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…

Rings and Algebras · Mathematics 2016-08-16 Delphine Boucher , Willi Geiselmann , Félix Ulmer

MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual…

Information Theory · Computer Science 2019-11-14 Aixian Zhang , Keqin Feng

Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution…

Information Theory · Computer Science 2018-01-31 Joseph Connelly , Kenneth Zeger

Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, secure two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…

Information Theory · Computer Science 2022-01-11 Haibo Liu , Qunying Liao

We give the structure of $\lambda$-constacyclic codes of length $p^sm$ over $R=\mathbb{F}_{p^r}+u \mathbb{F}_{p^r}+...+ u^{e-1}\mathbb{F}_{p^r}$ with $\lambda \in \F_{p^r}^*$. We also give the structure of $\lambda$-constacyclic codes of…

Information Theory · Computer Science 2012-12-03 Kenza Guenda , T. Aaron Gulliver

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

Information Theory · Computer Science 2022-01-03 Yansheng Wu , Chengju Li , Fu Xiao

Among the finitely generated modules over a Noetherian ring R, the semidualizing modules have been singled out due to their particularly nice duality properties. When R is a normal domain, we exhibit a natural inclusion of the set of…

Commutative Algebra · Mathematics 2007-05-23 Sean Sather-Wagstaff

In this paper, necessary and sufficient conditions for the reversibility of a cyclic code of arbitrary length over a finite commutative chain ring have been derived. MDS reversible cyclic codes having length p^s over a finite chain ring…

Information Theory · Computer Science 2023-07-25 Monika Dalal , Sucheta Dutt , Ranjeet Sehmi

In this paper we develop a technique to extend any bound for cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes. We use this technique to improve the searching of new bounds for abelian codes.

Information Theory · Computer Science 2016-04-12 J. J. Bernal , M. Guerreiro , J. J. Simón

Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…

Information Theory · Computer Science 2009-10-19 J. Borges , S. T. Dougherty , C. Fernandez-Cordoba

In this paper, we determine all self-dual codes over $F_p+vF_p$ ($v^2=v$) in terms of self-dual codes over the finite field $F_p$ and give an explicit construction for self-dual codes over $F_p+vF_p$, where $p$ is a prime.

Information Theory · Computer Science 2013-04-18 Guanghui Zhang , Bocong Chen

We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and…

Information Theory · Computer Science 2019-04-26 Bustomi , Aditya Purwa Santika , Djoko Suprijanto

Let $p$ be a prime number. In this paper, we discuss the structures of cyclic codes over the ring $ \mathbb{F}_p[u, v] / \langle u^k, v^2, uv-vu\rangle$. We find a unique set of generators for these codes. We also study the rank and the…

Information Theory · Computer Science 2015-08-31 Bappaditya Ghosh , Pramod Kumar Kewat

Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…

Information Theory · Computer Science 2007-07-13 Eric Zhi Chen

In this paper we characterize the algebraic structure of two-dimensional $(\alpha,\beta )$-constacyclic codes of arbitrary length $s.\ell$ and of their duals. For $\alpha,\beta \in \{1,-1\}$, we give necessary and sufficient conditions for…

Information Theory · Computer Science 2020-07-30 Swati Bhardwaj , Madhu Raka

Codes considered as structures within unit schemes greatly extends the availability of linear block and convolutional codes and allows the construction of these codes to required length, rate, distance and type. Properties of a code emanate…

Information Theory · Computer Science 2025-11-18 Ted Hurley