Følg
Ahmed Hareedy
Ahmed Hareedy
Assistant Professor, EEE Department, Middle East Technical University
Verifisert e-postadresse på metu.edu.tr - Startside
Tittel
Sitert av
Sitert av
År
Finite-length construction of high performance spatially-coupled codes via optimized partitioning and lifting
H Esfahanizadeh, A Hareedy, L Dolecek
IEEE Transactions on Communications 67 (1), 3-16, 2018
502018
Non-Binary LDPC Codes for Magnetic Recording Channels: Error Floor Analysis and Optimized Code Design
A Hareedy, B Amiri, R Galbraith, L Dolecek
IEEE Transactions on Communications 64 (8), 3194-3207, 2016
402016
A general non-binary LDPC code optimization framework suitable for dense flash memory and magnetic storage
A Hareedy, C Lanka, L Dolecek
IEEE Journal on Selected Areas in Communications 34 (9), 2402-2415, 2016
392016
A combinatorial methodology for optimizing non-binary graph-based codes: Theoretical analysis and applications in data storage
A Hareedy, C Lanka, N Guo, L Dolecek
IEEE Transactions on information theory 65 (4), 2128-2154, 2018
292018
Spatially coupled codes optimized for magnetic recording applications
H Esfahanizadeh, A Hareedy, L Dolecek
IEEE Transactions on Magnetics 53 (2), 1-11, 2016
292016
A channel-aware combinatorial approach to design high performance spatially-coupled codes
A Hareedy, R Wu, L Dolecek
IEEE Transactions on Information Theory 66 (8), 4834-4852, 2020
252020
Minimizing the number of detrimental objects in multi-dimensional graph-based codes
A Hareedy, R Kuditipudi, R Calderbank
IEEE Transactions on Communications 68 (9), 5299-5312, 2020
242020
High performance non-binary spatially-coupled codes for flash memories
A Hareedy, H Esfahanizadeh, L Dolecek
2017 IEEE Information Theory Workshop (ITW), 229-233, 2017
232017
LOCO codes: Lexicographically-ordered constrained codes
A Hareedy, R Calderbank
IEEE Transactions on Information Theory 66 (6), 3572-3589, 2019
222019
A novel combinatorial framework to construct spatially-coupled codes: Minimum overlap partitioning
H Esfahanizadeh, A Hareedy, L Dolecek
2017 IEEE International Symposium on Information Theory (ISIT), 1693-1697, 2017
222017
Managing device lifecycle: Reconfigurable constrained codes for M/T/Q/P-LC Flash memories
A Hareedy, B Dabak, R Calderbank
IEEE Transactions on Information Theory 67 (1), 282-295, 2020
152020
Spatially-coupled codes for channels with SNR variation
H Esfahanizadeh, A Hareedy, R Wu, R Galbraith, L Dolecek
IEEE Transactions on Magnetics 54 (11), 1-5, 2018
152018
The secret arithmetic of patterns: a general method for designing constrained codes based on lexicographic indexing
A Hareedy, B Dabak, R Calderbank
IEEE Transactions on Information Theory 68 (9), 5747-5778, 2022
142022
Asymmetric LOCO codes: Constrained codes for Flash memories
A Hareedy, R Calderbank
2019 57th Annual Allerton Conference on Communication, Control, and …, 2019
142019
Power spectra of constrained codes with level-based signaling: Overcoming finite-length challenges
J Centers, X Tan, A Hareedy, R Calderbank
IEEE Transactions on Communications 69 (8), 4971-4986, 2021
122021
Non-binary LDPC code optimization for partial-response channels
A Hareedy, B Amiri, S Zhao, R Galbraith, L Dolecek
2015 IEEE Global Communications Conference (GLOBECOM), 1-6, 2015
112015
Breaking the computational bottleneck: Probabilistic optimization of high-memory spatially-coupled codes
S Yang, A Hareedy, R Calderbank, L Dolecek
IEEE Transactions on Information Theory 69 (2), 886-909, 2022
102022
Non-binary constrained codes for two-dimensional magnetic recording
B Dabak, A Hareedy, R Calderbank
IEEE Transactions on Magnetics 56 (11), 1-10, 2020
102020
Spatially-coupled code design for partial-response channels: Optimal object-minimization approach
A Hareedy, H Esfahanizadeh, A Tan, L Dolecek
2018 IEEE Global Communications Conference (GLOBECOM), 1-7, 2018
102018
Efficient constrained codes that enable page separation in modern Flash memories
A Hareedy, S Zheng, P Siegel, R Calderbank
IEEE Transactions on Communications, 2023
92023
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20