default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReza Sobhani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Maryam Bajalan
, Edgar Martínez-Moro, Reza Sobhani, Steve Szabo, Gülsüm Gözde Yilmazgüç:
On the structure of repeated-root polycyclic codes over local rings. Discret. Math. 347(1): 113715 (2024)- [i4]Farzad Parvaresh, Reza Sobhani, Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari, Maryam Khatami:
Improved bounds on the size of permutation codes under Kendall τ-metric. CoRR abs/2406.06029 (2024) - 2023
- [j13]Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari, Maryam Khatami, Farzad Parvaresh, Reza Sobhani:
New upper bounds on the size of permutation codes under Kendall τ-metric. Cryptogr. Commun. 15(5): 891-903 (2023) - 2022
- [j12]Fatemeh Jafari, Alireza Abdollahi, Javad Bagherian, Maryam Khatami, Reza Sobhani:
Equidistant permutation group codes. Des. Codes Cryptogr. 90(12): 2841-2859 (2022) - [j11]H. Aghili, R. Sobhani:
Left dihedral codes over finite chain rings. Discret. Math. 345(4): 112767 (2022) - [c1]Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari, Maryam Khatami, Farzad Parvaresh, Reza Sobhani:
New table of Bounds on Permutation Codes under Kendall τ-Metric. IWCIT 2022: 1-3 - [i3]Maryam Bajalan, Edgar Martínez-Moro, Reza Sobhani, Steve Szabo, Gulsum Gozde Yilmazguc:
On the structure of repeated-root polycyclic codes over local rings. CoRR abs/2208.00512 (2022) - 2021
- [i2]H. Aghili, R. Sobhani:
Left Dihedral Codes over Finite Chain Rings. CoRR abs/2105.07499 (2021)
2010 – 2019
- 2019
- [j10]Reza Sobhani, Alireza Abdollahi, Javad Bagherian, Maryam Khatami:
A note on good permutation codes from Reed-Solomon codes. Des. Codes Cryptogr. 87(10): 2335-2340 (2019) - 2018
- [j9]R. Sobhani:
Cyclic codes over a non-commutative finite chain ring. Cryptogr. Commun. 10(3): 519-530 (2018) - [j8]H. R. Mahmoodi, R. Sobhani:
On some constacyclic codes over the ring Fpm[u]∕〈u4〉. Discret. Math. 341(11): 3106-3122 (2018) - 2017
- [i1]Reza Sobhani, Zhonghua Sun, Liqi Wang, Shixin Zhu:
A note on complete classification of (δ+αu2)-constacyclic codes of length pk over $\F_{p^m}+u\F_{p^m}+u^2\F_{p^m}$. CoRR abs/1702.04694 (2017) - 2016
- [j7]Reza Sobhani:
Matrix-product structure of repeated-root cyclic codes over finite fields. Finite Fields Their Appl. 39: 216-232 (2016) - 2015
- [j6]R. Sobhani:
Complete classification of (δ+αu2)-constacyclic codes of length pk over Fpm+uFpm+u2Fpm. Finite Fields Their Appl. 34: 123-138 (2015) - 2014
- [j5]R. Sobhani:
Generalised array low-density parity-check codes. IET Commun. 8(12): 2121-2130 (2014) - 2012
- [j4]R. Sobhani:
Approach to the construction of regular low-density parity-check codes from group permutation matrices. IET Commun. 6(12): 1750-1756 (2012) - 2010
- [j3]Reza Sobhani, Morteza Esmaeili:
Some Constacyclic and Cyclic Codes Over Fq[u]/<ut+1>. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(4): 808-813 (2010)
2000 – 2009
- 2009
- [j2]Reza Sobhani, Morteza Esmaeili:
Cyclic and negacyclic codes over the Galois ring GR(p2, m). Discret. Appl. Math. 157(13): 2892-2903 (2009) - [j1]Reza Sobhani, Morteza Esmaeili:
A note on cyclic codes over GR(p2, m) of length pk. Finite Fields Their Appl. 15(3): 387-391 (2009)
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-10-07 22: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:
