Permutation decoding for codes from designs, finite geometries and graphs
From MaRDI portal
Recommendations
- Partial permutation decoding for codes from affine geometry designs
- Codes from multipartite graphs and minimal permutation decoding sets
- Permutation decoding for the binary codes from triangular graphs.
- scientific article; zbMATH DE number 2170433
- Partial permutation decoding for codes from finite planes
Cited in
(19)- Error-correcting codes from permutation groups
- Permutation decoding for the binary codes from triangular graphs.
- On the existence of PD-sets: algorithms arising from automorphism groups of codes
- \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\)
- Antiblocking systems and PD-sets
- Codes from multipartite graphs and minimal permutation decoding sets
- Permutation decoding of codes from generalized Paley graphs
- Permutation decoding of abelian codes
- scientific article; zbMATH DE number 1135092 (Why is no real title available?)
- scientific article; zbMATH DE number 2170433 (Why is no real title available?)
- scientific article; zbMATH DE number 824710 (Why is no real title available?)
- Permutation decoding of \(\mathbb Z_2{\mathbb Z}_4\)-linear codes
- Linear codes resulting from finite group actions
- Comparing decoding methods for quaternary linear codes
- PD-sets for codes related to flag-transitive symmetric designs
- On linear codes admitting large automorphism groups
- Permutation Decoding of Systematic Codes
- Codes from lattice and related graphs, and permutation decoding
- Designer of codes: a tribute to Jennifer Key
This page was built for publication: Permutation decoding for codes from designs, finite geometries and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195094)
