An effective source recognition algorithm: extraction of significant binary words

DOI10.1016/S0167-8655(00)00054-4MaRDI QIDQ4527940zbMATH OpenOpenAlexFDO

Authors Shri Kant, Neelam Verma

Publication date 29 January 2001

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8655(00)00054-4

zbMATH Keywords

binary words

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Pattern recognition, speech recognition (68T10)

Recommendations

• Deterministic alternatives to statistical tests in binary pattern generators
• On Recognition of Shift Registers
• Binary Pseudo-Random Sequences Theory
• scientific article; zbMATH DE number 3954821
• Distribution of the number of words with a prescribed frequency and tests of randomness

Cited in

(1)

• Comparative performance of the classifiers for cryptosystem identification

This page was built for publication: An effective source recognition algorithm: extraction of significant binary words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527940)