English
Related papers

Related papers: The dual of convolutional codes over $\mathbb{Z}_{…

200 papers

A new kind of Convolutional Codes generalizing Goppa Codes is proposed. This provides a systematic method for constructing convolutional codes with prefixed properties. In particular, examples of Maximum-Distance Separable (MDS)…

Optimization and Control · Mathematics 2007-07-16 J. A. Dominguez Perez , J. M. Muñoz Porras , G. Serrano Sotelo

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Commutative Algebra · Mathematics 2021-10-07 H. Al-Ezeh , A. A. Al-Maktry , S. Frisch

Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…

Information Theory · Computer Science 2022-07-14 Ted Hurley

In this study, in order to get better codes, we focus on double skew cyclic codes over the ring $\mathrm{R}= \mathbb{F}_q+v\mathbb{F}_q, ~v^2=v$ where $q$ is a prime power. We investigate the generator polynomials, minimal spanning sets,…

Information Theory · Computer Science 2024-05-14 Ashutosh Singh , Tulay Yildirim , Om Prakash

In this paper we study the structure of $\theta$-cyclic codes over the ring $B_k$ including its connection to quasi-$\tilde{\theta}$-cyclic codes over finite field $\mathbb{F}_{p^r}$ and skew polynomial rings over $B_k.$ We also…

Combinatorics · Mathematics 2017-05-18 Irwansyah , Aleams Barra , Intan Muchtadi-Alamsyah , Ahmad Muchlis , Djoko Suprijanto

In this paper, we present an infinite family of MDS codes over $\mathbb{F}_{2^s}$ and two infinite families of almost MDS codes over $\mathbb{F}_{p^s}$ for any prime $p$, by investigating the parameters of the dual codes of two families of…

Information Theory · Computer Science 2024-11-12 Haojie Xu , Xia Wu , Wei Lu , Xiwang Cao

In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…

Information Theory · Computer Science 2026-05-28 Cristina Flaut , Bianca Liana Bercea-Straton

Maximum Distance Separable (MDS) convolutional codes are cha- racterized through the property that the free distance meets the generalized Singleton bound. The existence of free MDS convolutional codes over Z p r was recently discovered in…

Information Theory · Computer Science 2016-01-19 Diego Napp , Raquel Pinto , Marisa Toste

The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this geometrical description is less trivial, it can be…

Algebraic Geometry · Mathematics 2011-09-14 A. Couvreur

We define a new class of Convolutional Codes in terms of fibrations of algebraic varieties generalizaing our previous constructions of Convolutional Goppa Codes. Using this general construction we can give several examples of Maximum…

Information Theory · Computer Science 2010-12-23 J. I. Iglesias Curto , J. M. Muñoz Porras , F. J. Plaza Martín , G Serrano Sotelo

Let $\mathbb{F}_{q}$ be a finite field of cardinality $q$, $R=\mathbb{F}_{q}[u]/\langle u^4\rangle=\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}+u^3\mathbb{F}_{q}$ $(u^4=0)$ which is a finite chain ring, and $n$ be a positive integer…

Information Theory · Computer Science 2015-11-10 Yuan Cao , Yonglin Cao , Jian Gao

We consider two types of convolutions ($\ast$ and $\star$) of functions on spaces of finite configurations (finite subsets of a phase space), and some their properties are studied. A connection of the $\ast$-convolution with the convolution…

Probability · Mathematics 2015-01-27 Dmitri Finkelshtein

For a prime $p$ and a positive integer $m$, let $\mathbb{F}_{p^m}$ be the finite field of characteristic $p$, and $\mathfrak{R}_l:=\mathbb{F}_{p^m}[v]/\langle v^l-v\rangle$ be a non-chain ring. In this paper, we study the…

Information Theory · Computer Science 2023-12-14 Ashutosh Singh , Priyanka Sharma , Om Prakash

Hyperovals in $\PG(2,\gf(q))$ with even $q$ are maximal arcs and an interesting research topic in finite geometries and combinatorics. Hyperovals in $\PG(2,\gf(q))$ are equivalent to $[q+2,3,q]$ MDS codes over $\gf(q)$, called hyperoval…

Information Theory · Computer Science 2018-04-18 Ziling Heng , Cunsheng Ding

In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.

Information Theory · Computer Science 2009-05-27 Murat Guzeltepe , Mehmet Ozen

We consider generalizations of Reed-Muller codes, toric codes, and codes from certain plane curves, such as those defined by norm and trace functions on finite fields. In each case we are interested in codes defined by evaluating arbitrary…

Information Theory · Computer Science 2007-07-16 Maria Bras-Amorós , Michael E. O'Sullivan

In this paper, we study the theory for constructing DNA cyclic codes of odd length over $\Z_4[u]/\langle u^2 \rangle$ which play an important role in DNA computing. Cyclic codes of odd length over $\Z_4 + u \Z_4$ satisfy the reverse…

Information Theory · Computer Science 2015-08-11 Sukhamoy Pattanayak , Abhay Kumar Singh

Hypercomplex Fourier transforms are increasingly used in signal processing for the analysis of higher-dimensional signals such as color images. A main stumbling block for further applications, in particular concerning filter design in the…

Classical Analysis and ODEs · Mathematics 2013-03-08 Roxana Bujack , Hendrik De Bie , Nele De Schepper , Gerik Scheuermann

$(1+pw)$-constacyclic codes of arbitrary length over the non-principal ideal ring $\mathbb{Z}_{p^s} +u\mathbb{Z}_{p^s}$ are studied, where $p$ is a prime, $w\in \mathbb{Z}_{p^s}^{\times}$ and $s$ an integer satisfying $s\geq 2$. First, the…

Information Theory · Computer Science 2017-03-03 Yuan Cao , Yonglin Cao

In coding theory, a very interesting problem (but at the same time, a very difficult one) is to determine the weight distribution of a given code. This problem is even more interesting for cyclic codes, and this is so, mainly because they…

Information Theory · Computer Science 2016-06-29 Gerardo Vega
‹ Prev 1 4 5 6 7 8 10 Next ›