Clark, W.E., Blocking sets in finite projective spaces and uneven binary codes, Discrete Mathematics 94 (1991) 65-68. A l-blocking set in the projective space PG(m, 2), m >2, is a set B of points such that any (m -I)-flat meets B and no l-flat is contained in B. A binary linear code is said to be un
The packing problem in statistics, coding theory and finite projective spaces
β Scribed by J.W.P. Hirschfeld; L. Storme
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 179 KB
- Volume
- 72
- Category
- Article
- ISSN
- 0378-3758
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Introduction. The theory of discrete approximation serves as a framework of approximation and discretization methods for the numerical solution of functional equations. This theory allows a unified functional-analytic treatment of these methods. It was developed by several authors (see e.g. the
The theory of scattering is studied for the nonlinear wave equation iu+|u| r -1 u=0 in space dimensions n=3, 4. We give a new proof of the asymptotic completeness in the finite energy and conformal charge space for n=r=3. Our method is strong enough to deal with the subconformal power r < 1+4/(n -1)
We continue a program to develop layer potential techniques for PDE on Lipschitz domains in Riemannian manifolds. Building on L p and Hardy space estimates established in previous papers, here we establish Sobolev and Besov space estimates on solutions to the Dirichlet and Neumann problems for the L