Abstract
Merit factor of a binary sequence is reviewed, and constructions are described that appear to satisfy an asymptotic merit factor of 6.3421... Multivariate merit factor is characterised and recursive Boolean constructions are presented which satisfy a non-vanishing asymptote in multivariate merit factor. Clifford merit factor is characterised as a generalisation of multivariate merit factor and as a type of quantum merit factor. Recursive Boolean constructions are presented which, however, only satisfy an asymptotic Clifford merit factor of zero. It is demonstrated that Boolean functions obtained via quantum error correcting codes tend to maximise Clifford merit factor. Results are presented as to the distribution of the above merit factors over the set of binary sequences and Boolean functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.