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

We construct families of three-dimensional linear codes that attain the Griesmer bound and give a probablistic construction of linear codes that are close to the Griesmer bound. All these codes contain the all-1 codeword and are constructed from small multiple blocking sets in AG(2, q).

• Type: Journal
• Year: 2007
• Where: DM
• Authors: Simeon Ball, Elisa Montanucci
• Keywords: DM 2007, Linear Codes, Probablistic Construction, Three-dimensional Linear Codes