Abstract
AbstractA single‐change covering design (SCCD) is a ‐set and an ordered list of blocks of size where every pair from must occur in at least one block. Each pair of consecutive blocks differs by exactly one element. This is a linear single‐change covering design, or more simply, a single‐change covering design. A single‐change covering design is circular when the first and last blocks also differ by one element. A single‐change covering design is minimum if no other smaller design can be constructed for a given . In this paper, we use a new recursive construction to solve the existence of circular SCCD() for all and three residue classes of circular SCCD() modulo 16. We solve the existence of three residue classes of SCCD modulo 16. We prove the existence of circular SCCD, for all , using difference methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
