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

We construct families of three-dimensional linear codes that attain the Griesmer bound and give a non-explicit construction of linear codes that are one away from the Griesmer bound. All these codes contain the all-1 codeword and are constructed from small multiple blocking sets in image.