CRT and Fixed Patterns in Combinatorial Sequences
Abstract
In this paper, new context of Chinese Remainder Theorem (CRT) based analysis of combinatorial sequence generators has been presented. CRT is exploited to establish fixed patterns in LFSR sequences and underlying cyclic structures of finite fields. New methodology of direct computations of DFT spectral points in higher finite fields from known DFT spectra points of smaller constituent fields is also introduced. Novel approach of CRT based structural analysis of LFSR based combinatorial sequence is given both in time and frequency domain. The proposed approach is demonstrated on some examples of combiner generators and is scalable to general configuration of combiner generators.
Cite
@article{arxiv.1504.01099,
title = {CRT and Fixed Patterns in Combinatorial Sequences},
author = {Muhammad Asad Khan and Amir Ali Khan and Fauzan Mirza},
journal= {arXiv preprint arXiv:1504.01099},
year = {2015}
}
Comments
New results on finite fields theory of combinatorial sequences and their CRT based analysis. arXiv admin note: substantial text overlap with arXiv:1503.00943