Partial permutation decoding for simplex codes
From MaRDI portal
Recommendations
Cited in
(15)- Codes associated with the odd graphs
- Partial permutation decoding for binary linear Hadamard codes
- Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes
- On the existence of PD-sets: algorithms arising from automorphism groups of codes
- Antiblocking systems and PD-sets
- Partial permutation decoding and PD-sets for \(\mathbb{Z}_{p^s}\)-linear generalized Hadamard codes
- Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even
- Conjectural permutation decoding of some AG codes
- Consolidation for compact constraints and Kendall tau LP decodable permutation codes
- Permutation decoding of \(\mathbb Z_2{\mathbb Z}_4\)-linear codes
- Partial permutation decoding for MacDonald codes
- Permutation decoding of codes from generalized Paley graphs
- Improved partial permutation decoding for Reed-Muller codes
- Comparing decoding methods for quaternary linear codes
- On linear codes admitting large automorphism groups
This page was built for publication: Partial permutation decoding for simplex codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394838)
