Pages that link to "Item:Q394838"
From MaRDI portal
The following pages link to Partial permutation decoding for simplex codes (Q394838):
Displayed 11 items.
- Partial permutation decoding for binary linear Hadamard codes (Q283663) (← links)
- Codes associated with the odd graphs (Q393176) (← links)
- Permutation decoding of \(\mathbb Z_2{\mathbb Z}_4\)-linear codes (Q498979) (← links)
- Partial permutation decoding for MacDonald codes (Q503553) (← links)
- Improved partial permutation decoding for Reed-Muller codes (Q507498) (← links)
- Comparing decoding methods for quaternary linear codes (Q510602) (← links)
- On linear codes admitting large automorphism groups (Q517270) (← links)
- On the existence of PD-sets: algorithms arising from automorphism groups of codes (Q2025365) (← links)
- Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes (Q2413011) (← links)
- Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even (Q2682394) (← links)
- Partial permutation decoding and PD-sets for \(\mathbb{Z}_{p^s}\)-linear generalized Hadamard codes (Q6185636) (← links)