CYCLE STRUCTURE OF PERMUTATION FUNCTIONS OVER FINITE FIELDS AND THEIR APPLICATIONS

被引：17

作者：

Sakzad, Amin ^{[1
]}

Sadeghi, Mohammad-Reza ^{[1
]}

Panario, Daniel ^{[2
]}

机构：

[1] Amirkabir Univ Technol, Dept Math & Comp Sci, Tehran, Iran

[2] Carleton Univ, Sch Math & Stat, Ottawa, ON K1S 5B6, Canada

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2012年 / 6卷 / 03期

关键词：

Interleavers and permutation functions over finite fields; INTERLEAVERS; POLYNOMIALS;

D O I：

10.3934/amc.2012.6.347

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this work we establish some new interleavers based on permutation functions. The inverses of these interleavers are known over a finite field F q. For the first time Möbius and Rédei functions are used to give new deterministic interleavers. Furthermore we employ Skolem sequences in order to find new interleavers with known cycle structure. In the case of Rédei functions an exact formula for the inverse function is derived. The cycle structure of Rédei functions is also investigated. The self-inverse and non-self-inverse versions of these permutation functions can be used to construct new interleavers. © 2012 AIMS.

引用

页码：347 / 361

页数：15

共 34 条

[1]

Ahmad Shair., 1969, J COMB THEORY, V6, P370

[2]

[Anonymous], P 3 INT S TURB COD R

[3] Shakespeare's 'Othello' [J].

Baker, C .

EXPLICATOR, 2002, 60 (02) :63-63

[4]

BERROU C, 1993, IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS 93 : TECHNICAL PROGRAM, CONFERENCE RECORD, VOLS 1-3, P1064, DOI 10.1109/ICC.1993.397441

[5] On quasi-cyclic interleavers for parallel turbo codes [J].