Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Telecommunication Systems
Erschienen in: Telecommunication Systems 2/2018

17.05.2017

Determining the number of true different permutation polynomials of degrees up to five by Weng and Dong algorithm

verfasst von: Lucian Trifina, Daniela Tarniceriu

Erschienen in: Telecommunication Systems | Ausgabe 2/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Permutation polynomials (PPs) are used for interleavers in turbo codes, cryptography or sequence generation. The paper presents an algorithm for determining the number of true different PPs of degrees up to five. It is based on the algorithm from Weng and Dong (IEEE Trans Inf Theory 54(9):4388–4390, 2008) and on the null polynomials modulo the interleaver length.
Vorheriger Artikel Price competition between a macrocell and a small-cell service provider with limited resources and optimal bandwidth user subscription: a game-theoretical model
Nächster Artikel Anomaly-based framework for detecting dynamic spectrum access attacks in cognitive radio networks

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
1.
Takeshita, O. Y. (2007). Permutation polynomial interleavers: An algebraic-geometric perspective. IEEE Transactions on Information Theory, 53(6), 2116–2132.CrossRef
2.
Sun, J., & Takeshita, O. Y. (2005). Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Transactions on Information Theory, 51(1), 101–119.CrossRef
3.
Takeshita, O. Y. (2006). On maximum contention-free interleavers and permutation polynomials over integer rings. IEEE Transactions on Information Theory, 52(3), 1249–1253.CrossRef
4.
Ryu, J., & Takeshita, O. Y. (2006). On quadratic inverses for quadratic permutation polynomials over integer rings. IEEE Transactions on Information Theory, 52(3), 1254–1260.CrossRef
5.
Takeshita, O.Y. (2006). A new metric for permutation polynomial interleavers. In Proceedings of IEEE international symposium on information theory (ISIT), Seattle, USA, pp. 1983–1987.
6.
Rosnes, E., & Takeshita, O.Y. (2006). Optimum distance quadratic permutation polynomial-based interleavers for turbo codes. In Proceedings of IEEE international symposium on information theory (ISIT), Seattle, USA, pp. 1988–1992.
7.
Tarniceriu, D., Trifina, L., & Munteanu, V. (2009). About minimum distance for QPP interleavers. Annals of Telecommunications, 64(9–10), 745–751.CrossRef
8.
Zhao, H., Fan, P., & Tarokh, V. (2010). On the equivalence of interleavers for turbo codes using quadratic permutation polynomials over integer rings. IEEE Communications Letters, 14(3), 236–238.CrossRef
9.
Trifina, L., Tarniceriu, D., & Munteanu, V. (2011). Improved QPP interleavers for LTE standard. In Proceedings of IEEE international symposium on signals, circuits and systems (ISSCS), Iasi, Romania, pp. 403–406.
10.
Ryu, J. (2012). Efficient address generation for permutation polynomial based interleavers over integer rings. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E95–A(1), 421–424.CrossRef
11.
Lahtonen, J., Ryu, J., & Suvitie, E. (2012). On the degree of the inverse of quadratic permutation polynomial interleavers. IEEE Transactions on Information Theory, 58(6), 3925–3932.CrossRef
12.
Rosnes, E. (2012). On the minimum distance of turbo codes with quadratic permutation polynomial interleavers. IEEE Transactions on Information Theory, 58(7), 4781–4795.CrossRef
13.
Trifina, L., Tarniceriu, D., & Munteanu, V. (2012). On dispersion and nonlinearity degree of QPP interleavers. Applied Mathemathics & Information Sciences, 6(3), 397–400.
14.
Ryu, J. (2012). Permutation polynomials of higher degrees for turbo code interleavers. IEICE Transactions on Communications, E95–B(12), 3760–3762.CrossRef
15.
Trifina, L., & Tarniceriu, D. (2014). Improved method for searching interleavers from a certain set using Garello’s method with applications for the LTE standard. Annals of Telecommunications, 69(5–6), 251–272.CrossRef
16.
17.
Trifina, L., & Tarniceriu, D. (2013). Analysis of cubic permutation polynomials for turbo codes. Wireless Personal Communications, 69(1), 1–22.CrossRef
18.
Chen, Y.-L., Ryu, J., & Takeshita, O. Y. (2006). A simple coefficient test for cubic permutation polynomials over integer rings. IEEE Communications Letters, 10(7), 549–551.CrossRef
19.
Zhao, H., & Fan, P. (2007). A note on A simple coefficient test for cubic permutation polynomials over integer rings. IEEE Communications Letters, 11(12), 991.CrossRef
20.
Weng, G., & Dong, C. (2008). A note on permutation polynomials over \(\mathbb{Z}_n\). IEEE Transactions on Information Theory, 54(9), 4388–4390.CrossRef
21.
22.
Ryu, J., & Takeshita, O.Y. (2011). On inverses for quadratic permutation polynomials over integer rings. arxiv:​1102.​2223v1. Accessed March 18, 2011.
23.
Trifina, L., & Tarniceriu, D. (2017). A simple method to determine the number of true different quadratic and cubic permutation polynomial based interleavers for turbo codes. Telecommunication Systems, 64(1), 147–171.CrossRef
24.
Nöbauer, W. (1965). Über permutationspolynome und permutationsfunktionen für primzahlpotenzen. Monatshefte für Mathematik, 69(3), 230–238.
25.
Mullen, G. L., & Stevens, H. (1984). Polynomial functions \((\text{ mod } m)\). Acta Mathematica Hungarica, 44(3–4), 237–241.CrossRef
26.
Hardy, G. H., & Wright, E. M. (1975). An Introduction to the Theory of Numbers (4th ed.). Oxford: Oxford University Press.
27.
Dickson, L. E. (1896–1897). The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group. Annals of Mathematics, 11(1/6), 65–120.
28.
Rivest, R. L. (2001). Permutation polynomials modulo \(2^w\). Finite Fields and Their Applications, 7(2), 287–292.CrossRef
29.
Trifina, L., & Tarniceriu, D. (2017). A coefficient test for quintic permutation polynomials. Submitted to publication.
30.
Trifina, L., & Tarniceriu, D. (2016). The number of different true permutation polynomial based interleavers under Zhao and Fan sufficient conditions. Telecommunication Systems, 63(4), 593–623.CrossRef
31.
Zhao, H., & Fan, P. (2007). Simple method for generating \(m\)th-order permutation polynomials over integer rings. Electronics Letters, 43(8), 449–451.CrossRef
32.
Metadaten
Titel
Determining the number of true different permutation polynomials of degrees up to five by Weng and Dong algorithm
verfasst von
Lucian Trifina
Daniela Tarniceriu
Publikationsdatum
17.05.2017
Verlag
Springer US
Erschienen in
Telecommunication Systems / Ausgabe 2/2018
Print ISSN: 1018-4864
Elektronische ISSN: 1572-9451
DOI
https://doi.org/10.1007/s11235-017-0335-y

Weitere Artikel der Ausgabe 2/2018

Telecommunication Systems 2/2018 Zur Ausgabe

OriginalPaper

Fuzzy logic based 3D localization in wireless sensor networks using invasive weed and bacterial foraging optimization

OriginalPaper

Challenges and research directions for Internet of Things

OriginalPaper

Defending against phishing attacks: taxonomy of methods, current issues and future directions

OriginalPaper

Improved DV-Hop localization algorithm using teaching learning based optimization for wireless sensor networks

OriginalPaper

Self-organizing technique for improving coverage in connected mobile objects networks

OriginalPaper

Anomaly-based framework for detecting dynamic spectrum access attacks in cognitive radio networks

Neuer Inhalt

    Bildnachweise