default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucian Trifina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j15]Lucian Trifina
, Daniela G. Tarniceriu, Jonghoon Ryu, Ana-Mirela Rotopanescu:
Upper bounds on the minimum distance for turbo codes using CPP interleavers. Telecommun. Syst. 76(3): 423-447 (2021)- 2020
- [j14]Lucian Trifina, Daniela G. Tarniceriu, Jonghoon Ryu, Ana-Mirela Rotopanescu:
Lengths for Which Fourth Degree PP Interleavers Lead to Weaker Performances Compared to Quadratic and Cubic PP Interleavers. Entropy 22(1): 78 (2020) - [j13]Lucian Trifina, Daniela G. Tarniceriu, Jonghoon Ryu, Ana-Mirela Rotopanescu:
Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers. J. Frankl. Inst. 357(5): 3097-3112 (2020) - [j12]Lucian Trifina, Daniela G. Tarniceriu, Jonghoon Ryu, Ana-Mirela Rotopanescu:
Further upper bounds on the minimum distance for turbo codes using CPP interleavers. Phys. Commun. 43: 101212 (2020)
2010 – 2019
- 2019
- [j11]Lucian Trifina, Daniela G. Tarniceriu:
Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers. J. Frankl. Inst. 356(5): 3139-3168 (2019) - [j10]Lucian Trifina, Daniela G. Tarniceriu:
Correction to: The number of different true permutation polynomial based interleavers under Zhao and Fan sufficient conditions. Telecommun. Syst. 70(1): 141-158 (2019) - [c2]Lucian Trifina, Daniela G. Tarniceriu, Ana-Mirela Rotopanescu:
Nonlinearity Degree for CPP, 4-PP, and 5-PP Interleavers for Turbo Codes. ECAI 2019: 1-8 - 2018
- [j9]Lucian Trifina, Daniela G. Tarniceriu:
A Coefficient Test for Quintic Permutation Polynomials Over Integer Rings. IEEE Access 6: 37893-37909 (2018) - [j8]Lucian Trifina, Daniela G. Tarniceriu:
Determining the number of true different permutation polynomials of degrees up to five by Weng and Dong algorithm. Telecommun. Syst. 67(2): 211-215 (2018) - 2017
- [j7]Lucian Trifina, Daniela G. Tarniceriu:
On the Equivalence of Cubic Permutation Polynomial and ARP Interleavers for Turbo Codes. IEEE Trans. Commun. 65(2): 473-485 (2017) - [j6]Lucian Trifina, Daniela G. Tarniceriu:
A simple method to determine the number of true different quadratic and cubic permutation polynomial based interleavers for turbo codes. Telecommun. Syst. 64(1): 147-171 (2017) - 2016
- [j5]Lucian Trifina, Daniela G. Tarniceriu:
The number of different true permutation polynomial based interleavers under Zhao and Fan sufficient conditions. Telecommun. Syst. 63(4): 593-623 (2016) - 2015
- [c1]Andy Vesa, Maria Kovaci, Lucian Trifina, Horia Balta:
Memory 4 triple-binary turbo codes of rate 0.6. MMAR 2015: 817-822 - 2014
- [j4]Lucian Trifina, Daniela G. Tarniceriu:
Improved method for searching interleavers from a certain set using Garello's method with applications for the LTE standard. Ann. des Télécommunications 69(5-6): 251-272 (2014) - 2013
- [j3]Lucian Trifina, Daniela G. Tarniceriu:
Analysis of Cubic Permutation Polynomials for Turbo Codes. Wirel. Pers. Commun. 69(1): 1-22 (2013) - 2012
- [i3]Lucian Trifina, Daniela G. Tarniceriu:
Improved Method for Searching of Interleavers Using Garello's Method. CoRR abs/1203.1410 (2012) - 2011
- [i2]Lucian Trifina, Daniela G. Tarniceriu, Valeriu Munteanu:
Improved QPP Interleavers for LTE Standard. CoRR abs/1103.3794 (2011) - [i1]Lucian Trifina, Daniela G. Tarniceriu:
Analysis of cubic permutation polynomials for turbo codes. CoRR abs/1106.1953 (2011)
2000 – 2009
- 2009
- [j2]Daniela G. Tarniceriu, Lucian Trifina, Valeriu Munteanu:
About minimum distance for QPP interleavers. Ann. des Télécommunications 64(11-12): 745-751 (2009) - 2007
- [j1]Lucian Trifina, Valeriu Munteanu, Daniela G. Tarniceriu:
Turbo codes with modified welch-costas interleavers. Ann. des Télécommunications 62(9-10): 1045-1052 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
