Abstract

We classify all coded masks onto which cyclic difference sets can be wrapped periodically using a generalization of the Finger and Prince construction. In particular, we establish simple numerical criteria which determine whether any given mask can be wrapped periodically in this way and, for each mask which can, we provide explicit constructions which will produce at least one such wrapping. We show that all periodic wrappings currently reported in the literature are special cases of our explicit constructions, and we often provide simpler alternatives. Using these constructions we show that all Singer cyclic difference sets of practical size and open fraction can be wrapped exactly onto masks which are very nearly as compact and symmetrical as hexagons, without the need for pixel padding.

Full Text
Paper version not known

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 call

Disclaimer: 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.