Pseudo Quasi-3 Designs and their Applications to Coding Theory

Simple item page
dc.creatorBracken, Carl
dc.date2008-04-10
dc.date.accessioned2026-07-07T09:31:35Z
dc.date.available2026-07-07T09:31:35Z
dc.descriptionWe 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.
dc.description9 pages, submitted to the European Journal of Comniatorics
dc.identifierhttps://arxiv.org/abs/0804.1740
dc.identifierhttp://arxiv.org/abs/0804.1740
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158510
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.titlePseudo Quasi-3 Designs and their Applications to Coding Theory
dc.typetext

Files

Collections

arXiv