arXiv:0804.1740 [math.CO]AbstractReferencesReviewsResources
Pseudo Quasi-3 Designs and their Applications to Coding Theory
Published 2008-04-10Version 1
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.
Comments: 9 pages, submitted to the European Journal of Comniatorics
Related articles: Most relevant | Search more
Applications of Symmetric Functions to Cycle and Subsequence Structure after Shuffles
A q-Analog of Dual Sequences with Applications
The BG-rank of a partition and its applications