Projective planes, coverings and a network problem
Document Type
Conference Proceeding
Publication Date
5-1-2003
Abstract
A study to investigate the projective planes, coverings and a network problem is presented. The maximum mass of weighted k-arcs in projective planes of order q when q is a prime power is determined. It is observed that a problem concerning packet switched networks leads to a natural combinatorial design problem, whose solution involves (k,n)-arcs in projective planes, 3-dimensional linear codes, the theory of fractional matchings and designs which approximate projective planes.
Publication Title
Designs, Codes, and Cryptography
Recommended Citation
Bierbrauer, J.,
Marcugini, S.,
&
Pambianco, F.
(2003).
Projective planes, coverings and a network problem.
Designs, Codes, and Cryptography,
29(1-3), 71-89.
http://doi.org/10.1023/A:1024140122167
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/8252
