MathDB2 problems
- 0 votes0 replies1 view
Tanner's richness conjecture for quasi-cyclic turbo-code interleavers
A quasi-cyclic permutation is a permutation with cyclic algebraic structure, and a quasi-cyclic turbo code is a turbo code produced by such an interleaver. Tanner's richness conjec…
- 0 votes0 replies0 views
Recursive Euclidean-like algorithms for sums from permutation polynomials
Recursive-algorithm conjecture. There exist recursive Euclidean-like algorithms for evaluating the sums associated with permutation polynomials of general degree , analogous to…