583 search results - page 1 / 117 » On small blocking sets and their linearity |
JCT
2008
13 years 5 months ago
2008
: We prove that a small blocking set of PG(2, q) is "very close" to be a linear blocking set over some subfield GF(pe) < GF(q). This implies that (i) a similar result ...
DM
2007
13 years 5 months ago
2007
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. Al...
ECOOPW
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We introduce a collection of high performance kernels for basic linear algebra. The kernels encapsulate small xed size computations in order to provide building blocks fo...
ISSAC
1994
Springer
13 years 9 months ago
1994
Springer
ICASSP
2009
IEEE
13 years 11 months ago
2009
IEEE
We introduce a new exemplar-based inpainting algorithm that represents the region to be inpainted as a sparse linear combination of example blocks, extracted from the image being ...