Projective Geometric Codes
โ Scribed by Bhaskar Bagchi; S.P. Inamdar
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 170 KB
- Volume
- 99
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
โฆ Synopsis
In this article, we determine the words of minimum weight in the code of the incidence system of s-versus t-flats in a finite projective space. Our proof depends on a few combinatorial results on the geometry of flats which may be of independent interest. We also give bounds for the minimum weight of the dual of this code and show that they are attained in many cases. The lower bound is a consequence of a general result on the dual code of an incidence system. # 2002 Elsevier Science (USA)
๐ SIMILAR VOLUMES
## Helleseth, T., Projective codes meeting the Griesmer bound, Discrete Mathematics 106/107 (1992) 265-271. We present a brief survey of projective codes meeting the Griesmer bound. Methods for constructing large families of codes as well as sporadic codes meeting the bound are given. Current res
This paper deals with an image coding scheme based on overlapped projections and geometrical vector quantization. As far as still images are concerned, we present a simple coding algorithm, in which, the concept of projection, normally employed in tomographic applications, and geometric vector quant