Affine blocking sets, three-dimensional codes and the Griesmer bound

DOI10.1016/j.disc.2006.09.011zbMath1135.94335OpenAlexW2048650713MaRDI QIDQ879336

E. Montanucci, Simeon Ball

Publication date: 11 May 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.011

zbMATH Keywords

linear codesGriesmer boundarcsaffine blocking sets

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Blocking sets, ovals, (k)-arcs (51E21)

Related Items (1)

On complete \((N,d)\)-arcs derived from plane curves

Cites Work

• On \((k,n)\)-arcs
• A class of \(((p^ n-p^ m)(p^ n-1)\), \(p^ n-p^ m)\)-arcs in \(PG(2,p^ n)\)
• Polynomial multiplicities over finite fields and intersection sets
• On nuclei and blocking sets in Desarguesian spaces
• On multiple nuclei and a conjecture of Lunelli and Sce
• On intersection sets in Desarguesian affine spaces
• Construction of \((n, r)\)-arcs in \(PG(2, q)\)
• Bounds on \((n,r)\)-arcs and their application to linear codes
• Optimal Linear Codes From Matrix Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Affine blocking sets, three-dimensional codes and the Griesmer bound