Ergebnisse für: perfect sequences

Boolean function algorithms binary sequences coding theory communication engineering complexity discrete Fourier transform information theory multisequences perfect sequences pseudo-random sequences random numbers sequence complexity sequences stream ciphers

Boolean function algorithms binary sequences coding theory communication engineering complexity discrete Fourier transform information theory multisequences perfect sequences pseudo-random sequences random numbers sequence complexity sequences stream ciphers

locally finite group G satisfying the minimum condition for p-subgroups (G « Min-p) Sylow-separated sequence of p-subgroups maximum conditions (for IpG and for the Sylow-separated sequences of p-subgroups) finite simple group split sequence of finite p-perfect subgroups (very) good Sylow p-subgroup p-uniqueness subgroup singular Sylow p-subgroup minimal p-unique subgroup conjugacy of maximal (i.e. Sylow) p-subgroups singular p-subgroup locally finite group satisfying the (strong) Sylow Theorem for the prime p (or the [strong] Sylow p-Theorem) (G « Syl-p) (proper) Sylow p-intersection the (numerical) Sylow p-invariants 1) p-uniqueness and 2) Sylow p-intersection split sequence of finite p-perfect subgroups