AbstractFor any finite commutative ring B with an identity there is a strict inclusion B[X;Z0]⊂B[X;12;Z0]⊂B[X;122Z0] of commutative semigroup rings. This work is a continuation of Shah et al. (2011) [8], in which we extend the study of Andrade and Palazzo (2005) [7] for cyclic codes through the semigroup ring B[X;12;Z0]. In this study we developed a construction technique of cyclic codes through a semigroup ring B[X;122Z0] instead of a polynomial ring. However in the second phase we independently considered BCH, alternant, Goppa, Srivastava codes through a semigroup ring B[X;122Z0]. Hence we improved several results of Shah et al. (2011) [8] and Andrade and Palazzo (2005) [7] in a broader sense
Codes over finite rings have been studied in the early 1970. A great deal of attention has been give...
Abstract. In this paper we present a construction technique of cyclic, BCH, alternat, Goppa and Sriv...
In a previous paper (Codes over certain rings, Inform. Contr. 20, 396–404) Blake defined codes over ...
For any finite commutative ring B with an identity there is a strict inclusion B[X; Z(0)] subset of ...
AbstractFor any finite commutative ring B with an identity there is a strict inclusion B[X;Z0]⊂B[X;1...
It is very well known that algebraic structures have valuable applications in the theory of error-co...
This paper introduces novel constructions of cyclic codes using semigroup rings instead of polynomia...
This paper introduces novel constructions of cyclic codes using semigroup rings instead of polynomia...
In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes ...
Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and is the monoid S s...
. An extension theorem for general weight functions is proved over finite commutative local principa...
This thesis contains structure theorems for several types of Artinian rings, in particular, finite ...
This thesis contains structure theorems for several types of Artinian rings, in particular, finite ...
In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for...
We introduce linear cyclic codes over the ring F 2 + uF 2 = f0; 1; u; u = u + 1g, where u 2 = 0. T...
Codes over finite rings have been studied in the early 1970. A great deal of attention has been give...
Abstract. In this paper we present a construction technique of cyclic, BCH, alternat, Goppa and Sriv...
In a previous paper (Codes over certain rings, Inform. Contr. 20, 396–404) Blake defined codes over ...
For any finite commutative ring B with an identity there is a strict inclusion B[X; Z(0)] subset of ...
AbstractFor any finite commutative ring B with an identity there is a strict inclusion B[X;Z0]⊂B[X;1...
It is very well known that algebraic structures have valuable applications in the theory of error-co...
This paper introduces novel constructions of cyclic codes using semigroup rings instead of polynomia...
This paper introduces novel constructions of cyclic codes using semigroup rings instead of polynomia...
In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes ...
Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and is the monoid S s...
. An extension theorem for general weight functions is proved over finite commutative local principa...
This thesis contains structure theorems for several types of Artinian rings, in particular, finite ...
This thesis contains structure theorems for several types of Artinian rings, in particular, finite ...
In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for...
We introduce linear cyclic codes over the ring F 2 + uF 2 = f0; 1; u; u = u + 1g, where u 2 = 0. T...
Codes over finite rings have been studied in the early 1970. A great deal of attention has been give...
Abstract. In this paper we present a construction technique of cyclic, BCH, alternat, Goppa and Sriv...
In a previous paper (Codes over certain rings, Inform. Contr. 20, 396–404) Blake defined codes over ...