In this study, we explore maximum distance separable (MDS) self-dual codes over Galois rings G R ( p m , r ) with p ≡ − 1 ( mod 4 ) and odd r.

In this study, we explore maximum distance separable (MDS) self-dual codes over Galois rings G R ( p m , r ) with p ≡ − 1 ( mod 4 ) and odd r.

In this study, we explore maximum distance separable (MDS) self-dual codes over Galois rings GR(pm,r) G R ( p m , r ) with p≡−1(mod4) p ≡ − 1 ( mod 4 ) ...

Abstract. We study self-dual codes over Galois rings using the building-up construction method. In the construction, the existence of an...

Abstract: In this study, we explore maximum distance separable (MDS) self-dual codes over Galois rings G R (p m , r) with p ≡ − 1 (mod 4) and odd r.

May 1, 2018 · In this study, we are interested in self-dual codes. Self-dual codes are interesting, because they are closely related to other areas of ...

In this study, we explore maximum distance separable (MDS) self-dual codes over Galois rings G R ( p m , r ) with p ≡ − 1 ( mod 4 ) and odd r.

In this study, we explore maximum distance separable (MDS) self-dual codes over Galois rings G R ( p m , r ) with p ≡ − 1 ( mod 4 ) and odd r.

Let R = GR(pm,r) be a Galois ring. We are interested in the exis- tence of MDS(Maximum Distance Separable) self-dual codes over R. If.

Missing: MDS | Show results with:MDS