2019/11/26 by Muhammad Asad Khan, Khan, Muhammad Asad, Sajid Saleem +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Data Compression Techniques #Advanced Steganography and Watermarking Techniques #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1911.11437
openalex publication_date 2019/11/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, new results on convolution of spectral components in binary fields have been presented for combiatorial sequences. A novel method of convolution of DFT points through Chinese Remainder Theorem (CRT) is presented which has lower complexity as compared to known methods of spectral point computations. Exploring the inherent structures in cyclic nature of finite fields, certain fixed mappings between the spectral components from composite fields to their decomposed subfield components has been illustrated which are significant for analysis of combiner generators. Complexity estimations of our CRT based methodology of convolutions in binary fields proves that our proposed method is far efficient as comparised to to existing methods of DFT computations for convolving sequences in frequency domain.