Premium
Pseudo quasi‐3 designs and their applications to coding theory
Author(s) -
Bracken Carl
Publication year - 2009
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20208
Subject(s) - mathematics , residual , construct (python library) , combinatorics , set (abstract data type) , coding (social sciences) , property (philosophy) , block design , block (permutation group theory) , combinatorial design , discrete mathematics , algorithm , computer science , statistics , philosophy , epistemology , programming language
We define a pseudo quasi‐3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi‐symmetric. Quasi‐symmetric designs can be used to construct optimal self complementary codes. In this article we give a construction of an infinite family of pseudo quasi‐3 designs whose residual designs allow us to construct a family of codes with a new parameter set that meet the Grey Rankin bound. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 411–418, 2009