Antiblocking systems and PD-sets
From MaRDI portal
Publication:2468024
DOI10.1016/j.disc.2006.11.056zbMath1143.94026OpenAlexW1981057457MaRDI QIDQ2468024
Hans-Joachim Kroll, Rita Vincenti
Publication date: 30 January 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.11.056
Finite affine and projective planes (geometric aspects) (51E15) Blocking sets, ovals, (k)-arcs (51E21) Decoding (94B35) Finite geometry and special incidence structures (51E99)
Related Items (7)
Codes from incidence matrices of graphs ⋮ Error-correcting codes from \(k\)-resolving sets ⋮ How to find small AI-systems for antiblocking decoding ⋮ On linear codes admitting large automorphism groups ⋮ Antiblocking decoding ⋮ On the existence of PD-sets: algorithms arising from automorphism groups of codes ⋮ Generalized covering designs and clique coverings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permutation decoding for the binary codes from triangular graphs.
- PD-sets for the codes related to some classical varieties
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Blocking Sets in Finite Projective Planes
- Permutation Decoding of Systematic Codes
- Implementation of decoders for cyclic codes (Corresp.)
This page was built for publication: Antiblocking systems and PD-sets