Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes

DOI10.1007/s10623-009-9298-7zbMath1178.51008OpenAlexW2024761666MaRDI QIDQ1035813

Szabolcs L. Fancsali, Simeon Ball

Publication date: 4 November 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9298-7

zbMATH Keywords

linear codesGriesmer boundminihypers\(t\)-fold blocking sets

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Blocking sets, ovals, (k)-arcs (51E21)

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomial multiplicities over finite fields and intersection sets
• On the size of a blocking set in \(\text{PG}(2,p)\)
• On intersection sets in Desarguesian affine spaces
• A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
• On the minimum length of some linear codes
• Lacunary Polynomials, Multiple Blocking Sets and Baer Subplanes
• Multiple Blocking Sets and Arcs in Finite Planes
• On multiple blocking sets in Galois planes
• Small blocking sets in higher dimensions

This page was built for publication: Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes