Skip to main content
SpringerLink
Log in

Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We present characterization results on non-weighted minihypers. For minihypers in PG(k−1,q), q not a square, we improve greatly the results of Hamada, Helleseth, and Maekawa, and of Ferret and Storme. The largest improvements are obtained for q prime.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ball S. (1996). Multiple blocking sets and arcs in finite planes. J. London Math. Soc. (2) 54(3): 581–593

    MATH  MathSciNet  Google Scholar 

  2. Belov B.I., Logachev V.N., Sandimirov V.P. (1974). Construction of a class of linear binary codes that attain the Varšamov-Griesmer bound. Problemy Peredači Informacii 10(3): 36–44

    MATH  Google Scholar 

  3. Blokhuis A.: On multiple nuclei and a conjecture of Lunelli and Sce. Bull. Belg. Math. Soc. Simon Stevin, 1(3), 349–353 (1994). A tribute to J. A. Thas (Gent, 1994).

  4. Blokhuis A., Storme L., Szonyi T. (1999). Lacunary polynomials, multiple blocking sets and Baer subplanes. J. London Math. Soc. 2 60(2): 321–332

    Article  MathSciNet  Google Scholar 

  5. Bruen A.A. (1971). Blocking sets in finite projective planes. SIAM J. Appl. Math. 21: 380–392

    Article  MATH  MathSciNet  Google Scholar 

  6. Bruen A.A. (1992). Polynomial multiplicities over finite fields and intersection sets. J. Combin. Theory Ser. A 60(1): 19–33

    Article  MATH  MathSciNet  Google Scholar 

  7. De Beule J., Metsch K., Storme L.: Characterization results on arbitrary weighted minihypers and on linear codes meeting the Griesmer bound. Adv. Math. Commun. (submitted).

  8. Ferret S., Storme L. (2002). Minihypers and linear codes meeting the Griesmer bound: improvements to results of Hamada, Helleseth and Maekawa. Des. Codes Cryptogr. 25(2): 143–162

    Article  MATH  MathSciNet  Google Scholar 

  9. Ferret S., Storme L. (2006). A classification result on weighted \(\{\delta v_{\mu+1},\delta v_\mu;N,p^3\}\) -minihypers. Discrete Appl. Math. 154(2): 277–293

    Article  MATH  MathSciNet  Google Scholar 

  10. Ferret S., Storme L., Sziklai P., Weiner Zs.: A t mod p) result on weighted multiple (n−k)-blocking sets in PG(n,q) Adv. Incidence Geom. (to appear).

  11. Govaerts P., Storme L. (2002). On a particular class of minihypers and its applications. II. Improvements for q square. J. Combin. Theory Ser. A 97(2): 369–393

    Article  MATH  MathSciNet  Google Scholar 

  12. Griesmer J.H. (1960). A bound for error-correcting codes. IBM J. Res. Dev. 4: 532–542

    Article  MATH  MathSciNet  Google Scholar 

  13. Hamada N.: Characterization of min·hypers in a finite projective geometry and its applications to error-correcting codes. Sūrikaisekikenkyūsho Kōokyūroku 607, 52–69 (1987). Designs and finite geometries (Kyoto, 1986).

  14. Hamada N. (1993). A characterization of some [n,k,d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry. Discrete Math. 116(1-3): 229–268

    Article  MATH  MathSciNet  Google Scholar 

  15. Hamada N., Helleseth T. (1993). A characterization of some q-ary codes (q > (h−1)2, h ≥ 3) meeting the Griesmer bound. Math. Japon. 38(5): 925–939

    MATH  MathSciNet  Google Scholar 

  16. Hamada N., Maekawa T. (1997). A characterization of some q-ary linear codes (q > (h−1)2, h ≥ 3) meeting the Griesmer bound. II. Math. Japon. 46(2): 241–252

    MATH  MathSciNet  Google Scholar 

  17. Hamada N., Tamari F. (1978). On a geometrical method of construction of maximal t-linearly independent sets. J. Combin. Theory Ser. A 25(1): 14–28

    Article  MATH  MathSciNet  Google Scholar 

  18. Hirschfeld J.W.P.: Projective geometries over finite fields. Oxford Mathematical Monographs, 2nd edn. The Clarendon Press, Oxford University Press, New York (1998).

  19. Pless V.S., Huffman W.C., Brualdi R.A.: An introduction to algebraic codes. In: Handbook of Coding Theory, vol. I, II, pp. 3–139. North-Holland, Amsterdam (1998).

  20. Solomon G., Stiffler J.J. (1965). Algebraically punctured cyclic codes. Inform. Control 8: 170–179

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Pure Mathematics and Computer Algebra, Ghent University, Krijgslaan 281-S22, 9000, Ghent, Belgium

    J. De Beule & L. Storme

  2. Mathematisches Institut, Justus-Liebig-Universität, Arndtstrasse 2, 35392, Giessen, Germany

    K. Metsch

Authors
  1. J. De Beule
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Metsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. Storme
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. Storme.

Additional information

This research was done while J. De Beule and L. Storme were visiting the Justus-Liebig-Universität Gießen, Germany, with respectively a research grant of the Fund for Scientific Research—Flanders (Belgium) and with an Alexander von Humboldt Fellowship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Beule, J., Metsch, K. & Storme, L. Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound. Des. Codes Cryptogr. 49, 187–197 (2008). https://doi.org/10.1007/s10623-008-9191-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-008-9191-9

Keywords

AMS Classifications

Search

Navigation