0
喜欢
0
书签
声明论文
Binary codes and caps   
摘  要:   The connection between maximal caps (sometimes called complete caps) and certain binary codes called quasi-perfect codes is described. We provide a geometric approach to the foundational work of Davydov and Tombak who have obtained the exact possible sizes of large maximal caps. A new self-contained proof of the existence and the structure of the largest maximal nonaffine cap in PG(n;2) is given. Combinatorial and geometric consequences are briefly sketched. Some of these, such as the connection with families of symmetric-difference free subsets of a finite set will be developed elsewhere. c 1998 John Wiley & Sons, Inc. J Combin Designs 6: 275{284, 1998
发  表:   ACM Journal of Computer Documentation  1998

论文统计图
共享有3个版本

Bibtex
创新指数 
阅读指数 
重现指数 
论文点评
还没有人点评哦

Feedback
Feedback
Feedback
我想反馈:
排行榜