Recommendations
- Permutation decoding for codes from designs, finite geometries and graphs
- Permutation decoding for the binary codes from triangular graphs.
- Codes from multipartite graphs and minimal permutation decoding sets
- Partial permutation decoding for binary linear Hadamard codes
- Partial permutation decoding for simplex codes
- Antiblocking decoding
- Error-correcting codes from permutation groups
- Partial permutation decoding for codes from affine geometry designs
- scientific article; zbMATH DE number 2170433
- Upper bounds on permutation codes via linear programming
Cites work
- scientific article; zbMATH DE number 1284415 (Why is no real title available?)
- scientific article; zbMATH DE number 775280 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- Blocking Sets in Finite Projective Planes
- Implementation of decoders for cyclic codes (Corresp.)
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- PD-sets for the codes related to some classical varieties
- Permutation Decoding of Systematic Codes
- Permutation decoding for the binary codes from triangular graphs.
Cited in
(10)- Codes from incidence matrices of graphs
- Partial permutation decoding for simplex codes
- \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\)
- On the existence of PD-sets: algorithms arising from automorphism groups of codes
- Generalized covering designs and clique coverings
- PD-sets for the codes related to some classical varieties
- How to find small AI-systems for antiblocking decoding
- On linear codes admitting large automorphism groups
- Antiblocking decoding
- Error-correcting codes from \(k\)-resolving sets
This page was built for publication: Antiblocking systems and PD-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468024)
