Projective Planes, Coverings and a Network Problem

被引：0
作者：
Jürgen Bierbrauer
Stefano Marcugini
Fernanda Pambianco
机构：
[1] Michigan Technological University,Department of Mathematical Sciences
[2] e Informatica Università degli Studi di Perugia,Dipartimento di Matematica
来源：
Designs, Codes and Cryptography | 2003年 / 29卷
关键词：
congestion-free networks; coverings; projective planes; arcs; designs; codes; fractional matchings; fractional covers; almost projective planes;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：71 / 89
页数：18
相关论文
共 17 条
[1]  
Bose R. C.(1952)Combinatorial properties of group divisible incomplete block designs Ann. Math. Statistics 23 367-383
[2]  
Connor W. S.(1953)On the construction of group divisible incomplete block designs Annals of Mathematical Statistics 24 167-195
[3]  
Bose R. C.(2002)Projective planes and congestion-free networks Discrete Applied Mathematics 122 117-126
[4]  
Shrikhande S. S.(1981)Maximum degree and fractional matchings in uniform hypergraphs Combinatorica 6 155-162
[5]  
Bhattacharya K. N.(1989)Covering the complete graph by partitions Discrete Mathematics 75 217-226
[6]  
Colbourn C. J.(1960)A bound for error-correcting codes IBM Journal Research Development 4 532-542
[7]  
Füredi Z.(1980)Construction of optimal codes and optimal fractional factorial designs using linear programming Annals of Discrete Mathematics 6 175-188
[8]  
Füredi Z.(1965)Algebraically punctured cyclic codes Information and Control 8 170-179
[9]  
Griesmer J. H.(1992)Cyclic difference covers through 133 Congressus Numerantium 90 181-185
[10]  
Hamada N.(1997)Combinatorial design of congestion-free networks IEEE/ACM Trans. Networking 5 989-1000
12