论文信息 - Projective Planes, Coverings and a Network Problem

Projective Planes, Coverings and a Network Problem

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.

[2] Zoltán Füredi,et al. Maximum degree and fractional matchings in uniform hypergraphs , 1981, Comb..

[3] W. S. Connor,et al. Combinatorial Properties of Group Divisible Incomplete Block Designs , 1952 .

[4] Aart Blokhuis,et al. Finite Geometries , 2018, Des. Codes Cryptogr..

[5] James H. Griesmer,et al. A Bound for Error-Correcting Codes , 1960, IBM J. Res. Dev..

[6] Douglas R Stinson,et al. Surveys in Combinatorics, 1999: Applications of Combinatorial Designs to Communications, Cryptography, and Networking , 1999 .

[7] R. C. Bose,et al. On the construction of group divisible incomplete block designs , 1953 .

[8] Moti Yung,et al. Combinatorial design of congestion-free networks , 1997, TNET.

[9] A. Blokhuis,et al. On a Class of Symmetric Divisible Designs which are Almost Projective Planes , 2001 .

[10] Jack J. Stiffler,et al. Algebraically Punctured Cyclic Codes , 1965, Inf. Control..

[11] Zoltán Füredi. Covering the complete graph by partitions , 1989, Discret. Math..

[12] Charles J. Colbourn,et al. Projective planes and congestion-free networks , 2002, Discret. Appl. Math..