Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Ramy Taki ElDin"'
Publikováno v:
Mathematics, Vol 11, Iss 11, p 2539 (2023)
We recall a classic lower bound on the minimum Hamming distance of constacyclic codes over finite fields, analogous to the well-known BCH bound for cyclic codes. This BCH-like bound serves as a foundation for proposing some minimum-distance lower bou
Externí odkaz:
https://doaj.org/article/4895e374c8894539a131ca2c8cc48a45
Autor:
Ramy Taki Eldin, Hajime Matsui
Publikováno v:
IEEE Access, Vol 8, Pp 143285-143293 (2020)
In this work, we study two classes of quasi-cyclic (QC) codes and examine how several properties can be combined into the codes of these classes. We start with the class of QC codes generated by diagonal generator polynomial matrices; a QC code in th
Externí odkaz:
https://doaj.org/article/10cc04d3d39641ec810bce9da18b4890
Publikováno v:
IEEE Access, Vol 7, Pp 179037-179047 (2019)
Any cyclic code over a finite field can be considered as a sum of some non-degenerate irreducible cyclic codes. We use the traditional trace function representation of irreducible cyclic codes to suggest a similar representation to any cyclic code. T
Externí odkaz:
https://doaj.org/article/fa2f2120fafd484494d381dfa64b7498
Autor:
Ramy Taki Eldin, Hajime Matsui
Publikováno v:
IEEE Access, Vol 7, Pp 184500-184508 (2019)
The finite field $\mathbb {F}_{q^\ell }$ of $q^\ell $ elements contains $\mathbb {F}_{q}$ as a subfield. If $\theta \in \mathbb {F}_{q^\ell }$ is of degree $\ell $ over $\mathbb {F}_{q}$ , it can be used to unfold elements of $\mathbb {F}_{q^\ell }$
Externí odkaz:
https://doaj.org/article/aa0d133ca5174548ab4922f0020e0a83
Autor:
Hajime Matsui, Ramy Taki ElDin
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :381-388
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8c24ee5e6fa5bb5beb6e60aff58a9ee
https://doi.org/10.1587/transfun.2021tap0010
https://doi.org/10.1587/transfun.2021tap0010
Autor:
Ramy Taki ElDin, Hajime Matsui
Publikováno v:
IEICE Communications Express. 9:668-673
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e172d4d4d117b597dc75ebf8fb1c1c7
https://doi.org/10.1587/comex.2020xbl0117
https://doi.org/10.1587/comex.2020xbl0117
Publikováno v:
International Journal of Theoretical Physics. 59:3043-3078
If we fix the code length n and dimension k, maximum distance separable (briefly, MDS) codes form an important class of codes because the class of MDS codes has the greatest error-correcting and detecting capabilities. In this paper, we establish all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c74b134d5d42dfc17e4f32f3e335012
https://doi.org/10.1007/s10773-020-04524-y
https://doi.org/10.1007/s10773-020-04524-y
Publikováno v:
IET Communications. 14:1718-1729
Recently, polar codes were proposed by Arikan to achieve optimum channel capacity given by Shannon theorem with low encoding and decoding complexity. Polar code construction depends on two main foundation criteria which are kernel matrix and Bhattach
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23e1ca9b8c9d8e4ef77467a844981cfa
https://doi.org/10.1049/iet-com.2019.0950
https://doi.org/10.1049/iet-com.2019.0950
Autor:
Hajime Matsui, Ramy Taki ElDin
Publikováno v:
IEEE Access, Vol 8, Pp 143285-143293 (2020)
In this work, we study two classes of quasi-cyclic (QC) codes and examine how several properties can be combined into the codes of these classes. We start with the class of QC codes generated by diagonal generator polynomial matrices; a QC code in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18c88071c59d9e6fdbce0927c5607ff2
https://ieeexplore.ieee.org/document/9154688/
https://ieeexplore.ieee.org/document/9154688/
Autor:
Ramy Taki ElDin, Hajime Matsui
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :325-333
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d5533e59c00240972188da592da45e4
https://doi.org/10.1587/transfun.2019eap1053
https://doi.org/10.1587/transfun.2019eap1053