Advanced search
Add to list

On 1-blocking sets in PG(n, q), n >= 3

Leo Storme (UGent) and Z Weiner
(2000) DESIGNS CODES AND CRYPTOGRAPHY. 21(1-3). p.235-251
Author
Organization

Citation

Please use this url to cite or link to this publication:

MLA
Storme, Leo, and Z. Weiner. “On 1-Blocking Sets in PG(n, q), n >= 3.” DESIGNS CODES AND CRYPTOGRAPHY, vol. 21, no. 1–3, 2000, pp. 235–51.
APA
Storme, L., & Weiner, Z. (2000). On 1-blocking sets in PG(n, q), n >= 3. DESIGNS CODES AND CRYPTOGRAPHY, 21(1–3), 235–251.
Chicago author-date
Storme, Leo, and Z Weiner. 2000. “On 1-Blocking Sets in PG(n, q), n >= 3.” DESIGNS CODES AND CRYPTOGRAPHY 21 (1–3): 235–51.
Chicago author-date (all authors)
Storme, Leo, and Z Weiner. 2000. “On 1-Blocking Sets in PG(n, q), n >= 3.” DESIGNS CODES AND CRYPTOGRAPHY 21 (1–3): 235–251.
Vancouver
1.
Storme L, Weiner Z. On 1-blocking sets in PG(n, q), n >= 3. DESIGNS CODES AND CRYPTOGRAPHY. 2000;21(1–3):235–51.
IEEE
[1]
L. Storme and Z. Weiner, “On 1-blocking sets in PG(n, q), n >= 3,” DESIGNS CODES AND CRYPTOGRAPHY, vol. 21, no. 1–3, pp. 235–251, 2000.
@article{123595,
  author       = {{Storme, Leo and Weiner, Z}},
  issn         = {{0925-1022}},
  journal      = {{DESIGNS CODES AND CRYPTOGRAPHY}},
  language     = {{eng}},
  number       = {{1-3}},
  pages        = {{235--251}},
  title        = {{On 1-blocking sets in PG(n, q), n >= 3}},
  volume       = {{21}},
  year         = {{2000}},
}

Web of Science
Times cited: