Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamy F. Taki ElDin
Person information
- affiliation: AinShams University, Faculty of Engineering, Cairo, Egypt
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Ramy F. Taki ElDin
:
Matrix product and quasi-twisted codes in one class. Comput. Appl. Math. 43(2): 95 (2024)- 2023
- [j10]Ramy F. Taki El-Din:
Two-sided Galois duals of multi-twisted codes. J. Appl. Math. Comput. 69(4): 3459-3487 (2023) - [i4]Ramy F. Taki ElDin, Patrick Solé:
Generator polynomial matrices of the Galois hulls of multi-twisted codes. CoRR abs/2305.15237 (2023) - [i3]Ramy F. Taki ElDin:
Matrix product and quasi-twisted codes in one class. CoRR abs/2309.13362 (2023) - 2022
- [j9]Ramy F. Taki ElDin, Hajime Matsui:
Linking Reversed and Dual Codes of Quasi-Cyclic Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 381-388 (2022) - [i2]Ramy F. Taki ElDin:
Multi-twisted codes as free modules over principal ideal domains. CoRR abs/2204.03156 (2022) - [i1]Ramy F. Taki ElDin:
The two-sided Galois duals of multi-twisted codes. CoRR abs/2210.07402 (2022) - 2021
- [c3]Karim El-Abbasy, Ramy F. Taki ElDin, Salwa El-Ramly, Bassant Abdelhamid:
Generalized Schematic Successive Cancellation Decoding for Polar Codes. BlackSeaCom 2021: 1-6 - 2020
- [j8]Ramy F. Taki ElDin, Hajime Matsui:
On Reversibility and Self-Duality for Some Classes of Quasi-Cyclic Codes. IEEE Access 8: 143285-143293 (2020) - [j7]Ramy F. Taki ElDin, Hajime Matsui:
Run-Length Constraint of Cyclic Reverse-Complement and Constant GC-Content DNA Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(1): 325-333 (2020) - [j6]Karim El-Abbasy, Ramy F. Taki ElDin, Salwa Elramly, Bassant Abdelhamid:
Polar codes Bhattacharyya parameter generalisation. IET Commun. 14(11): 1718-1730 (2020) - [c2]Ramy F. Taki ElDin, Hajime Matsui:
Generator Polynomial Matrices of Reversed and Reversible Quasi-Cyclic Codes. ISITA 2020: 165-169
2010 – 2019
- 2019
- [j5]Hai Q. Dinh, Ramy F. Taki ElDin, Jirakom Sirisrisakulchai:
Novel Indexing of Cyclic Codes With Run-Length Applications. IEEE Access 7: 179037-179047 (2019) - [j4]Ramy F. Taki ElDin, Hajime Matsui:
Quasi-Cyclic Codes Via Unfolded Cyclic Codes and Their Reversibility. IEEE Access 7: 184500-184508 (2019) - 2018
- [j3]Ramy F. Taki ElDin:
Applying Modular Arithmetic to Diophantine Equations. Integers 18: A64 (2018) - [c1]Ramy F. Taki ElDin, Hajime Matsui:
On Constant GC-content Cyclic DNA Codes With Long Codewords. ISITA 2018: 21-25 - 2013
- [j2]Ramy F. Taki El-Din, Rabab M. El-Hassani, Salwa H. El-Ramly:
Optimizing Chien Search Usage in the BCH Decoder for High Error Rate Transmission. IEEE Commun. Lett. 17(4): 741-744 (2013) - [j1]Ramy F. Taki El-Din, Rabab M. El-Hassani, Salwa H. El-Ramly:
A Novel High-Speed Systematic Encoder for Long Binary Cyclic Codes. IEEE Commun. Lett. 17(5): 984-987 (2013)
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-21 17:18 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:
