On Inverses for Quadratic Permutation Polynomials over Integer Rings
نویسندگان
چکیده
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.
منابع مشابه
A New Construction for LDPC Codes using Permutation Polynomials over Integer Rings
A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudorandom nature, and the new codes are quasi-cyclic. Graph isomorphisms and automorphisms are identified and used in an efficient search for good codes. Graphs with girth as large as 12 wer...
متن کاملOn the inverses of some classes of permutations of finite fields
We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field, where one of these is a linearized polynomial. In some cases we are able to explicitly obtain these inverses, thus obtaining the compositional inverse of the ...
متن کاملLDPC Convolutional Codes Based on Permutation Polynomials over Integer Rings
A novel algebraic construction technique for LDPC convolutional codes (LDPCCCs) based on permutation polynomials over integer rings is presented. The underlying elements of this construction technique are graph automorphisms and quasi-cyclic (QC) codes. The algebraic structure of the obtained LDPCCCs, their encoding and decoding are discussed. These new codes have a special structure, which is ...
متن کاملOn Two Conjectures about Permutation Trinomials over $\mathbb{F}_{3^{2k}}$
Permutation polynomials with few terms attracts researchers’ interest in recent years due to their simple algebraic form and some additional extraordinary properties. In this paper, by analyzing the quadratic factors of a fifth-degree polynomial and a seventh-degree polynomial over the finite field F32k , two conjectures on permutation trinomials over F32k proposed recently by Li, Qu, Li and Fu...
متن کاملSmall-span Hermitian matrices over quadratic integer rings
A totally real polynomial in Z[x] with zeros α1 6 α2 6 · · · 6 αn has span αn − α1. Building on the classification of all characteristic polynomials of integer symmetric matrices having span less than 4, we obtain a classification of polynomials having span less than 4 that are the characteristic polynomial of a Hermitian matrix over some quadratic integer ring. We obtain as characteristic poly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1102.2223 شماره
صفحات -
تاریخ انتشار 2011