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.
Projective planes, coverings and a network problem
MARCUGINI, Stefano;PAMBIANCO, Fernanda
2003
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
