\(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\)

DOI10.3934/amc.2020075zbMath1471.51004OpenAlexW3015651516MaRDI QIDQ2025378

Nina Mostarac, Dean Crnković, Storme, L., Bernardo Gabriel Rodrigues

Publication date: 12 May 2021

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2020075

zbMATH Keywords

linear codeDesarguesian projective planePD-setpermutation decoding.

Mathematics Subject Classification ID

Linear codes and caps in Galois spaces (51E22) Combinatorial structures in finite projective spaces (51E20) Desarguesian and Pappian geometries (51A30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On linear codes admitting large automorphism groups
• Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\)
• Bruck nets, codes, and characters of loops
• Partial permutation decoding for codes from finite planes
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• PD-sets for codes related to flag-transitive symmetric designs
• On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
• Permutation Decoding of Systematic Codes