Advanced search

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:

Chicago
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.
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.
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.
MLA
Storme, Leo, and Z WEINER. “On 1-blocking Sets in PG(n, Q), n >= 3.” DESIGNS CODES AND CRYPTOGRAPHY 21 (1-3 (2000): 235–251. Print.
@article{123595,
  author       = {Storme, Leo and WEINER, Z},
  issn         = {0925-1022},
  journal      = {DESIGNS CODES AND CRYPTOGRAPHY},
  language     = {eng},
  pages        = {235--251},
  title        = {On 1-blocking sets in PG(n, q), n >= 3.},
  volume       = {21 (1-3},
  year         = {2000},
}

Web of Science
Times cited: