On Inverses for Quadratic Permutation Polynomials over Integer Rings
Information Theory
2011-02-11 v1 math.IT
Abstract
Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient condition that determines the least degree inverse of a quadratic permutation polynomial is proven. Moreover, an algorithm is provided to explicitly compute the inverse polynomials.
Keywords
Cite
@article{arxiv.1102.2223,
title = {On Inverses for Quadratic Permutation Polynomials over Integer Rings},
author = {Jonghoon Ryu and Oscar Y. Takeshita},
journal= {arXiv preprint arXiv:1102.2223},
year = {2011}
}
Comments
21 pages, one column, Matlab files attached