Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 2/2007

01-11-2007

On the number of pairwise non-isomorphic minimal blocking sets in PG(2, q)

Author: Csaba Mengyán

Published in: Designs, Codes and Cryptography | Issue 2/2007

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …
previous article Construction of MDS self-dual codes over Galois rings
next article Errata for “The linear programming bound for codes over finite Frobenius rings”
Metadata
Title
On the number of pairwise non-isomorphic minimal blocking sets in PG(2, q)
Author
Csaba Mengyán
Publication date
01-11-2007
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 2/2007
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-007-9118-x

Other articles of this Issue 2/2007

Designs, Codes and Cryptography 2/2007 Go to the issue

OriginalPaper

The ψ-associate X # of a flat X in PG(n, 2)

OriginalPaper

Construction of MDS self-dual codes over Galois rings

OriginalPaper

A search algorithm for linear codes: progressive dimension growth

OriginalPaper

Kirkman frames having hole type h u m 1 for small h

Erratum

Errata for “The linear programming bound for codes over finite Frobenius rings”

OriginalPaper

Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits

Premium Partner

    Image Credits