A decoding algorithm for general \(\mathbb{Z}_4\)-linear codes (Q2571161)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decoding algorithm for general \(\mathbb{Z}_4\)-linear codes |
scientific article |
Statements
A decoding algorithm for general \(\mathbb{Z}_4\)-linear codes (English)
0 references
1 November 2005
0 references
The author presents a decoding algorithm for a general \(Z_4\)-linear code \(C\) and the complexity of this algorithm is determined. The connection of \(Z_4\)-linear codes to binary codes allows using this algorithm for some nonlinear binary codes. The algorithm is based on a subset of \(C\) called a test set. The paper does not contain an explicit way of constructing test sets, but several necessary conditions for a set to be a test set are given.
0 references
\(Z_4\)-linear code
0 references
Voronoi region
0 references
test set
0 references
