Skip to main content
SpringerLink
Log in

A Family of Binary (t, m,s)-Nets of Strength 5

Designs, Codes and Cryptography volume 37, pages 211–214 (2005)Cite this article

Abstract

(t,m,s)-Nets were defined by Niederreiter [Monatshefte fur Mathematik, Vol. 104 (1987) pp. 273–337], based on earlier work by Sobol’ [Zh. Vychisl Mat. i mat. Fiz, Vol. 7 (1967) pp. 784–802], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in combinatorial/coding theoretic terms a binary linear (m−k,m,s)2-net is a family of ks vectors in F m2 satisfying certain linear independence conditions (s is the length, m the dimension and k the strength: certain subsets of k vectors must be linearly independent). Helleseth et al. [5] recently constructed (2r−3,2r+2,2r−1)2-nets for every r. In this paper, we give a direct and elementary construction for (2r−3,2r+2,2r+1)2-nets based on a family of binary linear codes of minimum distance 6.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

39,95 €

Price includes VAT (Finland)

References

  1. J. Bierbrauer (2001) ArticleTitleThe theory of cyclic codes and a generalization to additive codes Designs, Codes and Cryptography 25 189–206

    Google Scholar 

  2. J. Bierbrauer Y. Edel (1997) ArticleTitleConstruction of digital nets from BCH-codes. Monte Carlo and Quasi-Monte Carlo Methods 1996 Lecture Notes in Statistics 127 221–231

    Google Scholar 

  3. J. Bierbrauer Y. Edel W. Ch. Schmid (2002) ArticleTitleCoding-theoretic constructions for tms-nets and ordered orthogonal arrays Journal of Combinatorial Designs 10 403–418 Occurrence Handle10.1002/jcd.10015

    Article  Google Scholar 

  4. Y. Edel J. Bierbrauer (2001) ArticleTitleFamilies of ternary (t,m,s)-nets related to BCH-codes Monatshefte für Mathematik 132 99–103 Occurrence Handle10.1007/s006050170047

    Article  Google Scholar 

  5. T. Helleseth T. Kløve V. Levenshtein (2003) ArticleTitleHypercubic 4-and 5-designs from double-error-correcting BCH codes Designs, Codes and Cryptography 28 265–282

    Google Scholar 

  6. H. Niederreiter (1987) ArticleTitlePoint sets and sequences with small discrepancy Monatshefte für Mathematik 104 273–337 Occurrence Handle10.1007/BF01294651

    Article  Google Scholar 

  7. I. M. Sobol’, Distribution of points in a cube and the approximate evaluation of integrals (in Russian), Zh. Vychisl.Mat. i Mat. Fiz, Vol. 7 (1967) pp. 784–802. English Translation in USSR Computational Mathematics and Mathematical Physics, Vol. 7 (1967) pp. 86–112.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Michigan Technological University, Houghton, MI, 49931, USA

    Jürgen Bierbrauer

  2. Mathematisches Institut der Universität, Im Neuenheimer Feld 288, 69120, Heidelberg, Germany

    Yves Edel

Authors
  1. Jürgen Bierbrauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yves Edel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jürgen Bierbrauer.

Additional information

Communicated by: T. Helleseth

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bierbrauer, J., Edel, Y. A Family of Binary (t, m,s)-Nets of Strength 5. Des Codes Crypt 37, 211–214 (2005). https://doi.org/10.1007/s10623-004-3986-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-004-3986-0

Keywords

  • Data Structure
  • Information Theory
  • Minimum Distance
  • Linear Code
  • Discrete Mathematic

Search

Navigation