Linear Codes over $\mathbb{F}_{q}[u]/(u^s)$ with Respect to the Rosenbloom---Tsfasman Metric
Designs, Codes and Cryptography
| Hi-index | 754.84 |
We present a method for decoding an arbitrary linear code over a Galois ring ℛ by a process of lifting decoding algorithms for a family of linear codes over a finite field 𝒦 forming an α-element chain, where 𝒦 is the quotient field of ℛ and ℛ has characteristic pα. As a new result, this method also works for linear codes over ℛ which are nonfree ℛ-modules