2016
DOI: 10.1007/s11235-016-0144-8
|View full text |Cite|
|
Sign up to set email alerts
|

The number of different true permutation polynomial based interleavers under Zhao and Fan sufficient conditions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
14
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(15 citation statements)
references
References 20 publications
1
14
0
Order By: Relevance
“…This means: z 1 = (−q 1 ) (mod p), z 2 = z 3 = · · · = z n = 0 (mod p), ∀ p | N , p > 2. 1 Zhao and Fan sufficient conditions for coefficients q 1 , q 2 , . .…”
Section: Null Polynomials Under Zhao and Fan Sufficient Conditionsmentioning
confidence: 99%
See 3 more Smart Citations
“…This means: z 1 = (−q 1 ) (mod p), z 2 = z 3 = · · · = z n = 0 (mod p), ∀ p | N , p > 2. 1 Zhao and Fan sufficient conditions for coefficients q 1 , q 2 , . .…”
Section: Null Polynomials Under Zhao and Fan Sufficient Conditionsmentioning
confidence: 99%
“…where 0 ≤ τ k ≤ gcd(k!, N ) − 1 (5) In (5), gcd stands for the greatest common divisor. The expanded form of (5) for n = 5 was given in [1] as…”
Section: Null Polynomials Under Zhao and Fan Sufficient Conditionsmentioning
confidence: 99%
See 2 more Smart Citations
“…By using it, the number of td QPPs and CPPs for every N were obtained. In [8,9], the method from [7] was used to determine the number of td CPPs, fourth-degree PPs (4-PPs), and fifth-degree PPs (5-PPs) under Zhao and Fan (ZF) sufficient conditions given in [10]. In [11], an algorithm to determine the number of td PPs of degrees up to five, based on the Weng and Dong (WD) algorithm from [12], was given.…”
Section: Introductionmentioning
confidence: 99%