Efficient decoding of Z/sub p/k-linear codes
From MaRDI portal
Recommendations
- Z(p/sup k+1/)-linear codes
- Systematic Encoding and Permutation Decoding for Zps-Linear Codes
- OPTIMAL LINEAR CODES OVER ℤm
- A decoding algorithm for general \(\mathbb{Z}_4\)-linear codes
- Codes Z2k-linéaires
- Z/sub 2/k-linear codes
- Algebraic decoding of the Zetterberg codes
- Decoding of linear codes over Galois rings
- On linear codes over \(\mathbb Z_2\)
- On Z2k -Linear and Quaternary Codes
Cited in
(10)- A decoding algorithm for general \(\mathbb{Z}_4\)-linear codes
- Systematic Encoding and Permutation Decoding for Zps-Linear Codes
- Construction of binary Hadamard codes and their \(s\)-PD sets
- scientific article; zbMATH DE number 5221430 (Why is no real title available?)
- On a Riemann hypothesis analogue for selfdual weight enumerators of genus less than 3
- On Z/sub 4/- and Z/sub 9/-linear lifts of the Golay codes
- Decoding of linear codes over Galois rings
- Information set decoding for ring-linear codes
- Codes over Galois rings with respect to the Rosenbloom-Tsfasman metric
- scientific article; zbMATH DE number 6691894 (Why is no real title available?)
This page was built for publication: Efficient decoding of Z/sub p/k-linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400357)