Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 36 results in range #1 to #36.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Linear Complexity over F p of Ternary Sidel’nikov Sequences: Label: en
  2. On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$: Label: en
  3. Codes for Optical CDMA: Label: en
  4. Multi-Continued Fraction Algorithms and Their Applications to Sequences: Label: en
  5. The Probabilistic Theory of the Joint Linear Complexity of Multisequences: Label: en
  6. Shift Register Sequences – A Retrospective Account: Label: en
  7. Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity: Label: en
  8. Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions: Label: en
  9. The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function: Label: en
  10. Reducing the Number of Homogeneous Linear Equations in Finding Annihilators: Label: en
  11. On Immunity Profile of Boolean Functions: Label: en
  12. Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance: Label: en
  13. Generalized Bounds on Partial Aperiodic Correlation of Complex Roots of Unity Sequences: Label: en
  14. Periodicity and Distribution Properties of Combined FCSR Sequences: Label: en
  15. On FCSR Memory Sequences: Label: en
  16. On the Distinctness of Decimations of Generalized l-Sequences: Label: en
  17. Nonexistence of a Kind of Generalized Perfect Binary Array: Label: en
  18. On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences: Label: en
  19. Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm: Label: en
  20. Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants: Label: en
  21. The Hausdorff Dimension of the Set of r-Perfect M-Multisequences: Label: en
  22. Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis: Label: en
  23. A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences: Label: en
  24. Sequences of Period 2 N –2: Label: en
  25. On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes: Label: en
  26. On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences: Label: en
  27. Computing the k-Error N-Adic Complexity of a Sequence of Period p n: Label: en
  28. On Lempel-Ziv Complexity of Sequences: Label: en
  29. Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression: Label: en
  30. Improved Rijndael-Like S-Box and Its Transform Domain Analysis: Label: en
  31. Security of Jump Controlled Sequence Generators for Stream Ciphers: Label: en
  32. Analysis of Designing Interleaved ZCZ Sequence Families: Label: en
  33. Extended Hadamard Equivalence: Label: en
  34. Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation: Label: en
  35. The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity: Label: en
  36. Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)