Projective Systems Whose Support is the Union of Two Linear Subspaces with Nonempty Intersection
- 35 Downloads
We consider the code corresponding to a projective system whose support is the union of two linear subspaces with nonempty intersection, and prove that the code is uniquely determined up to equivalence by its weight enumerator. Also we obtain the same conclusion for the complement of the union of two linear subspaces.
KeywordsLinear code Weight enumerator Projective system Projective space
Mathematics Subject Classification (2000)94B65 94B05 51E20 05B25
Unable to display preview. Download preview PDF.
- 1.Cheon, E.J., Kim, S.J.: Some codes determined by their weight enumerators. In: Procedures of ISAAC ’99 congress, vol 2. Kluwer Dordredet, 945–953 (2000).Google Scholar
- 2.Geer, G.V., Vlugt, M.V.: Generalized Hamming weights of codes and curves over finite fields with many points. In: Mathematical Preprint Series Report 94-02, pp 1–15 (1993)Google Scholar
- 4.Homma, M., Kim, S.J., Yoo, M.J.: Correction to our paper: projective systems supported on the complement of two linear subspaces. Bull Korean Math Soc (to appear)Google Scholar