TY - JOUR
AU - Wehlau, David L.
AB - 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 ℙG(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. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 275–284, 1998
TI - Binary codes and caps
JF - Journal of Combinatorial Designs
DO - 10.1002/(SICI)1520-6610(1998)6:4<275::AID-JCD5>3.0.CO;2-C
DA - 1998-01-01
UR - https://www.deepdyve.com/lp/wiley/binary-codes-and-caps-lF8BsNoevL
SP - 275
EP - 284
VL - 6
IS - 4
DP - DeepDyve
ER -