On extendable planes, M.D.S. codes and hyperovals in PG(2,q),q=2t
✍ Scribed by Aiden A. Bruen; Robert Silverman
- Publisher
- Springer
- Year
- 1988
- Tongue
- English
- Weight
- 547 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sharp when __q__ is a square. Here the bound is improved if __q__ is a non‐square. On the other hand, we present some constructions of reasonably large minimal blocking sets in planes of non‐p
First we define relations between the u = (s\* + s + 1) (s + 1) flags (point-line incident pairs) of a finite projective plane of order s. Two flags a E (p, 1) and b = (p', l'), where p and p' are two points and 1 and 1' are two lines of the projective plane, are defined to
## Abstract The paper written by M. Li, S. D. Holland and W. Q. Meeker [__Applied Stochastic Models in Business and Industry__] presents statistical methods for automatic Crack detection based on vibrothermography sequence‐of‐image data. In particular, a matched filter used to increase the signal‐t