Schur Ring, Run Structure and Periodic Compatible Binary Sequences
Ronald Orozco L\'opez

TL;DR
This paper explores the structure of specific Schur rings and their relation to binary sequences with special autocorrelation properties, introducing the concept of periodic compatible binary sequences and analyzing their bounds and applications.
Contribution
It characterizes a new general structure called periodic compatible binary sequences, extending previous work on Hadamard matrices and autocorrelation properties.
Findings
Established relations between Schur rings and combinatorial structures.
Characterized the structure of periodic compatible binary sequences.
Computed bounds on families of PComS in Hamming Schur ring.
Abstract
In this paper three Schur ring are discussed, namenly: Hamming, circulant orbists and decimated circulant orbits Schur ring. By using autocorrelation function and the run structure of binary sequences we proof the relation between this Schur ring and combinatorial structures such as Hadamard matrices, periodic compatible binary sequences and perfect binary sequences. Cai proved for binary sequences that the autocorrelation function is in fact completely determined by its run structure. Also, he characterised the structure of the circulant Hadamard matrices. We characterise a more general structure, called periodic compatible binary sequences ( for brevety), which generalises Hadamard matrices, periodic complementary binary sequences and binary sequences with -level autocorrelation. Families of periodic compatibles binary sequences are presented. Also, we compute a bounds on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Finite Group Theory Research
