{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:45:16Z","timestamp":1740123916970,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T00:00:00Z","timestamp":1494979200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s11235-017-0335-y","type":"journal-article","created":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T11:18:34Z","timestamp":1495019914000},"page":"211-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Determining the number of true different permutation polynomials of degrees up to five by Weng and Dong algorithm"],"prefix":"10.1007","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1697-6406","authenticated-orcid":false,"given":"Lucian","family":"Trifina","sequence":"first","affiliation":[]},{"given":"Daniela","family":"Tarniceriu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"issue":"6","key":"335_CR1","doi-asserted-by":"crossref","first-page":"2116","DOI":"10.1109\/TIT.2007.896870","volume":"53","author":"OY Takeshita","year":"2007","unstructured":"Takeshita, O. Y. (2007). Permutation polynomial interleavers: An algebraic-geometric perspective. IEEE Transactions on Information Theory, 53(6), 2116\u20132132.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"335_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TIT.2004.839478","volume":"51","author":"J Sun","year":"2005","unstructured":"Sun, J., & Takeshita, O. Y. (2005). Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Transactions on Information Theory, 51(1), 101\u2013119.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"335_CR3","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/TIT.2005.864450","volume":"52","author":"OY Takeshita","year":"2006","unstructured":"Takeshita, O. Y. (2006). On maximum contention-free interleavers and permutation polynomials over integer rings. IEEE Transactions on Information Theory, 52(3), 1249\u20131253.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"335_CR4","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1109\/TIT.2005.864442","volume":"52","author":"J Ryu","year":"2006","unstructured":"Ryu, J., & Takeshita, O. Y. (2006). On quadratic inverses for quadratic permutation polynomials over integer rings. IEEE Transactions on Information Theory, 52(3), 1254\u20131260.","journal-title":"IEEE Transactions on Information Theory"},{"key":"335_CR5","doi-asserted-by":"crossref","unstructured":"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\u20131987.","DOI":"10.1109\/ISIT.2006.261896"},{"key":"335_CR6","doi-asserted-by":"crossref","unstructured":"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\u20131992.","DOI":"10.1109\/ISIT.2006.261897"},{"issue":"9\u201310","key":"335_CR7","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/s12243-009-0120-3","volume":"64","author":"D Tarniceriu","year":"2009","unstructured":"Tarniceriu, D., Trifina, L., & Munteanu, V. (2009). About minimum distance for QPP interleavers. Annals of Telecommunications, 64(9\u201310), 745\u2013751.","journal-title":"Annals of Telecommunications"},{"issue":"3","key":"335_CR8","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/LCOMM.2010.03.091695","volume":"14","author":"H Zhao","year":"2010","unstructured":"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\u2013238.","journal-title":"IEEE Communications Letters"},{"key":"335_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013406.","DOI":"10.1109\/ISSCS.2011.5978745"},{"issue":"1","key":"335_CR10","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1587\/transfun.E95.A.421","volume":"E95\u2013A","author":"J Ryu","year":"2012","unstructured":"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\u2013A(1), 421\u2013424.","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"6","key":"335_CR11","doi-asserted-by":"crossref","first-page":"3925","DOI":"10.1109\/TIT.2012.2190492","volume":"58","author":"J Lahtonen","year":"2012","unstructured":"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\u20133932.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"335_CR12","doi-asserted-by":"crossref","first-page":"4781","DOI":"10.1109\/TIT.2012.2192095","volume":"58","author":"E Rosnes","year":"2012","unstructured":"Rosnes, E. (2012). On the minimum distance of turbo codes with quadratic permutation polynomial interleavers. IEEE Transactions on Information Theory, 58(7), 4781\u20134795.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"335_CR13","first-page":"397","volume":"6","author":"L Trifina","year":"2012","unstructured":"Trifina, L., Tarniceriu, D., & Munteanu, V. (2012). On dispersion and nonlinearity degree of QPP interleavers. Applied Mathemathics & Information Sciences, 6(3), 397\u2013400.","journal-title":"Applied Mathemathics & Information Sciences"},{"issue":"12","key":"335_CR14","doi-asserted-by":"crossref","first-page":"3760","DOI":"10.1587\/transcom.E95.B.3760","volume":"E95\u2013B","author":"J Ryu","year":"2012","unstructured":"Ryu, J. (2012). Permutation polynomials of higher degrees for turbo code interleavers. IEICE Transactions on Communications, E95\u2013B(12), 3760\u20133762.","journal-title":"IEICE Transactions on Communications"},{"issue":"5\u20136","key":"335_CR15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s12243-013-0360-0","volume":"69","author":"L Trifina","year":"2014","unstructured":"Trifina, L., & Tarniceriu, D. (2014). Improved method for searching interleavers from a certain set using Garello\u2019s method with applications for the LTE standard. Annals of Telecommunications, 69(5\u20136), 251\u2013272.","journal-title":"Annals of Telecommunications"},{"key":"335_CR16","unstructured":"3GPP TS 36.212 V8.3.0, 3rd Generation Partnership Project, Multiplexing and channel coding (Release 8), 2008. http:\/\/www.etsi.org\/deliver\/etsi_ts\/136200136299\/136212\/08.03.0060\/ts136212v080300p.pdf . Accessed June 5, 2015."},{"issue":"1","key":"335_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11277-012-0557-y","volume":"69","author":"L Trifina","year":"2013","unstructured":"Trifina, L., & Tarniceriu, D. (2013). Analysis of cubic permutation polynomials for turbo codes. Wireless Personal Communications, 69(1), 1\u201322.","journal-title":"Wireless Personal Communications"},{"issue":"7","key":"335_CR18","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/LCOM.2006.224416","volume":"10","author":"Y-L Chen","year":"2006","unstructured":"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\u2013551.","journal-title":"IEEE Communications Letters"},{"issue":"12","key":"335_CR19","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1109\/LCOMM.2007.071129","volume":"11","author":"H Zhao","year":"2007","unstructured":"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.","journal-title":"IEEE Communications Letters"},{"issue":"9","key":"335_CR20","doi-asserted-by":"crossref","first-page":"4388","DOI":"10.1109\/TIT.2008.926426","volume":"54","author":"G Weng","year":"2008","unstructured":"Weng, G., & Dong, C. (2008). A note on permutation polynomials over $$\\mathbb{Z}_n$$ Z n . IEEE Transactions on Information Theory, 54(9), 4388\u20134390.","journal-title":"IEEE Transactions on Information Theory"},{"key":"335_CR21","unstructured":"Ryu, J. (2007). Permutation polynomial based interleavers for turbo codes over integer rings. Ph.D. Thesis. https:\/\/etd.ohiolink.edu\/rws_etd\/document\/get\/osu1181139404\/inline . Accessed February 1, 2011."},{"key":"335_CR22","unstructured":"Ryu, J., & Takeshita, O.Y. (2011). On inverses for quadratic permutation polynomials over integer rings. arxiv:1102.2223v1 . Accessed March 18, 2011."},{"issue":"1","key":"335_CR23","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s11235-016-0166-2","volume":"64","author":"L Trifina","year":"2017","unstructured":"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\u2013171.","journal-title":"Telecommunication Systems"},{"key":"335_CR24","doi-asserted-by":"crossref","unstructured":"N\u00f6bauer, W. (1965). \u00dcber permutationspolynome und permutationsfunktionen f\u00fcr primzahlpotenzen. Monatshefte f\u00fcr Mathematik, 69(3), 230\u2013238.","DOI":"10.1007\/BF01303049"},{"issue":"3\u20134","key":"335_CR25","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01950276","volume":"44","author":"GL Mullen","year":"1984","unstructured":"Mullen, G. L., & Stevens, H. (1984). Polynomial functions $$(\\text{ mod } m)$$ ( mod m ) . Acta Mathematica Hungarica, 44(3\u20134), 237\u2013241.","journal-title":"Acta Mathematica Hungarica"},{"key":"335_CR26","volume-title":"An Introduction to the Theory of Numbers","author":"GH Hardy","year":"1975","unstructured":"Hardy, G. H., & Wright, E. M. (1975). An Introduction to the Theory of Numbers (4th ed.). Oxford: Oxford University Press.","edition":"4"},{"key":"335_CR27","doi-asserted-by":"crossref","unstructured":"Dickson, L. E. (1896\u20131897). 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\u2013120.","DOI":"10.2307\/1967217"},{"issue":"2","key":"335_CR28","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/ffta.2000.0282","volume":"7","author":"RL Rivest","year":"2001","unstructured":"Rivest, R. L. (2001). Permutation polynomials modulo $$2^w$$ 2 w . Finite Fields and Their Applications, 7(2), 287\u2013292.","journal-title":"Finite Fields and Their Applications"},{"key":"335_CR29","unstructured":"Trifina, L., & Tarniceriu, D. (2017). A coefficient test for quintic permutation polynomials. Submitted to publication."},{"issue":"4","key":"335_CR30","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s11235-016-0144-8","volume":"63","author":"L Trifina","year":"2016","unstructured":"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\u2013623.","journal-title":"Telecommunication Systems"},{"issue":"8","key":"335_CR31","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1049\/el:20070475","volume":"43","author":"H Zhao","year":"2007","unstructured":"Zhao, H., & Fan, P. (2007). Simple method for generating $$m$$ m th-order permutation polynomials over integer rings. Electronics Letters, 43(8), 449\u2013451.","journal-title":"Electronics Letters"},{"key":"335_CR32","unstructured":"http:\/\/telecom.etti.tuiasi.ro\/tti\/papers\/Text_files\/Number_of_true_diff_LPPs_QPPs_CPPs_4PPs_5PPs_N_000002_100000.txt ."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-017-0335-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-017-0335-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-017-0335-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T15:34:19Z","timestamp":1569339259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-017-0335-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,17]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["335"],"URL":"https:\/\/doi.org\/10.1007\/s11235-017-0335-y","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2017,5,17]]}}}