No abstract

We define a virtual projection of a Reed-Solomon code RS(q l , n, k) to an RS(q, n, k) Reed-Solomon code. A new probabilistic decoding algorithm that can be used to perform fractional decoding beyond the αdecoding radius is considered. An upper bound for the failure probability of the new algorithm is given, and the performance is illustrated by examples.

In this paper we consider self-dual NRT-codes, that is, self-dual codes in the metric space endowed with the Niederreiter-Rosenbloom-Tsfasman (NRT-metric). We use polynomial invariant theory to describe the shape enumerator [13] of a binary self-dual, doubly even self-dual, and doubly-doubly even self dual NRT-code C ⊆

No abstract