default search action
Khaled A. S. Abdel-Ghaffar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j70]Juane Li
, Yi Gong, Xin Xiao
Cyclic Partial Geometries and Their Associated LDPC and Constant-Weight Codes. IEEE Trans. Inf. Theory 69(9): 5570-5596 (2023) - [c72]Khaled A. S. Abdel-Ghaffar:
CRC in Coded Schemes with Bounded-Distance Decoding. WCNC 2023: 1-6 - 2022
- [c71]Juane Li, Yi Gong, Xin Xiao, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A Class of Cyclic Partial Geometries and Their Associated Constant Weight and LDPC Codes. ISITA 2022: 1-5 - 2021
- [j69]Xin Xiao
Quasi-Cyclic LDPC Codes With Parity-Check Matrices of Column Weight Two or More for Correcting Phased Bursts of Erasures. IEEE Trans. Commun. 69(5): 2812-2823 (2021) - [c70]Juane Li, Yi Gong, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Balanced Incomplete Block Designs, Partial Geometries, and Their Associated QC-LDPC Codes. ISTC 2021: 1-5 - 2020
- [j68]Shu Lin, Khaled A. S. Abdel-Ghaffar
A Scheme for Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths: Applications to Reed-Solomon, BCH, and Quadratic Residue Codes. IEEE Trans. Inf. Theory 66(9): 5358-5378 (2020)
2010 – 2019
- 2019
- [j67]Khaled A. S. Abdel-Ghaffar:
Sets of binary sequences with small total Hamming distances. Inf. Process. Lett. 142: 27-29 (2019) - [j66]Xin Xiao
Reed-Solomon Based Quasi-Cyclic LDPC Codes: Designs, Girth, Cycle Structure, and Reduction of Short Cycles. IEEE Trans. Commun. 67(8): 5275-5286 (2019) - [c69]Juane Li, Keke Liu, Shu Lin
Construction of Partial Geometries and LDPC codes based on Reed-Solomon Codes. ISIT 2019: 61-65 - [c68]Xin Xiao, Bane Vasic, Shu Lin
Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures. ISIT 2019: 71-75 - 2018
- [c67]Shu Lin, Khaled A. S. Abdel-Ghaffar, Juane Li, Keke Liu:
Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths in Galois-Fourier Transform Domain. ISTC 2018: 1-8 - [c66]Xin Xiao, Bane Vasic, Shu Lin
Girth-Eight Reed-Solomon Based QC-LDPC Codes. ISTC 2018: 1-5 - [c65]Juane Li, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Improved Trellis-Based Algorithm for Locating and Breaking Cycles in Bipartite Graphs with Applications to LDPC Codes. ITA 2018: 1-8 - [c64]Shu Lin, Khaled A. S. Abdel-Ghaffar, Juane Li, Keke Liu:
A Novel Coding Scheme for Encoding and Iterative Soft-Decision Decoding of Binary BCH Codes of Prime Lengths. ITA 2018: 1-10 - [c63]Xin Xiao, William E. Ryan, Bane Vasic, Shu Lin
Reed-Solomon-Based Quasi-Cyclic LDPC Codes: Designs, Cycle Structure and Erasure Correction. ITA 2018: 1-10 - 2017
- [j65]Dylan Smith, Theo G. Swart
Interleaved Constrained Codes With Markers Correcting Bursts of Insertions or Deletions. IEEE Commun. Lett. 21(4): 702-705 (2017) - [c62]Shu Lin, Khaled A. S. Abdel-Ghaffar, Juane Li, Keke Liu:
Iterative soft-decision decoding of reed-solomon codes of prime lengths. ISIT 2017: 341-345 - [c61]Juane Li, Keke Liu, Shu Lin
Reed-solomon based nonbinary globally coupled LDPC codes: Correction of random errors and bursts of erasures. ISIT 2017: 381-385 - [c60]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Bounds for cooperative locality using generalized hamming weights. ISIT 2017: 699-703 - [c59]Juane Li, Keke Liu, Shu Lin
Reed-Solomon based globally coupled quasi-cyclic LDPC codes. ITA 2017: 1-10 - [c58]Hsien-Ping Lin, Shu Lin
Integrated code design for a joint source and channel LDPC coding scheme. ITA 2017: 1-9 - 2016
- [b1]Juane Li, Shu Lin, Khaled A. S. Abdel-Ghaffar, William E. Ryan, Daniel J. Costello Jr.:
LDPC Code Designs, Constructions, and Unification. Cambridge University Press 2016, ISBN 9781316780152 - [j64]Wei Zhou, Shu Lin
On the Maximum True Burst-Correcting Capability of Fire Codes. IEEE Trans. Inf. Theory 62(10): 5323-5342 (2016) - [j63]Wei Zhou, Shu Lin
BCH Codes for the Rosenbloom-Tsfasman Metric. IEEE Trans. Inf. Theory 62(12): 6757-6767 (2016) - [c57]Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Reed-Solomon based nonbinary LDPC codes. ISITA 2016: 384-388 - [c56]Juane Li, Shu Lin
Globally coupled LDPC codes. ITA 2016: 1-10 - [c55]Wei Zhou, Shu Lin
Fire codes capable of correcting bursts beyond their guaranteed burst-correcting capabilities. ITA 2016: 1-5 - 2015
- [j62]Juane Li, Keke Liu, Shu Lin
A Matrix-Theoretic Approach to the Construction of Non-Binary Quasi-Cyclic LDPC Codes. IEEE Trans. Commun. 63(4): 1057-1068 (2015) - [j61]Hsien-Ping Lin, Shu Lin
Linear and Nonlinear Binary Kernels of Polar Codes of Small Dimensions With Maximum Exponents. IEEE Trans. Inf. Theory 61(10): 5253-5270 (2015) - [c54]Hsien-Ping Lin, Shu Lin
Binary nonlinear kernels of maximum exponents of polar codes of dimensions up to sixteen. ISIT 2015: 221-225 - [c53]Juane Li, Shu Lin
Improved message-passing algorithm for counting short cycles in bipartite graphs. ISIT 2015: 416-420 - [c52]Wei Zhou, Shu Lin
On the maximum true burst correcting capability of primitive Fire codes. ISIT 2015: 2411-2415 - [c51]Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar, William E. Ryan:
An unnoticed strong connection between algebraic-based and protograph-based LDPC codes, Part I: Binary case and interpretation. ITA 2015: 36-45 - [c50]Hsien-Ping Lin, Shu Lin
Binary kernel matrices of maximum exponents of polar codes of dimensions up to sixteen. ITA 2015: 84-89 - 2014
- [j60]Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme. IEEE Trans. Commun. 62(8): 2626-2637 (2014) - [c49]Shu Lin, Keke Liu, Juane Li, Khaled A. S. Abdel-Ghaffar:
A reduced-complexity iterative scheme for decoding quasi-cyclic low-density parity-check codes. ACSSC 2014: 119-125 - [c48]Keke Liu, Juane Li, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A merry-go-round decoding scheme for non-binary quasi-cyclic LDPC codes. GLOBECOM 2014: 1497-1503 - [c47]Ling Cheng, Theo G. Swart
Codes for correcting three or more adjacent deletions or insertions. ISIT 2014: 1246-1250 - [c46]Jos H. Weber, Carl H. Heymann, Hendrik C. Ferreira
Optimized markers for balancing runlength-limited sequences in optical recording. ISIT 2014: 1658-1662 - [c45]Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Quasi-cyclic LDPC codes on two arbitrary sets of a finite field. ISIT 2014: 2454-2458 - [c44]Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Construction of non-binary LDPC codes: A matrix-theoretic approach. ISTC 2014: 208-212 - [c43]Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Decoding of quasi-cyclic LDPC codes with section-wise cyclic structure. ITA 2014: 1-10 - [c42]Wei Zhou, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Burst or random error correction based on fire and BCH codes. ITA 2014: 1-5 - 2013
- [j59]Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A Revolving Iterative Algorithm for Decoding Algebraic Cyclic and Quasi-Cyclic LDPC Codes. IEEE Trans. Commun. 61(12): 4816-4827 (2013) - [j58]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Parity-Check Matrices Separating Erasures From Errors. IEEE Trans. Inf. Theory 59(6): 3332-3346 (2013) - [j57]Filip Paluncic, Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira
Insertion/Deletion Detecting Codes and the Boundary Problem. IEEE Trans. Inf. Theory 59(9): 5935-5943 (2013) - [j56]Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing. IEEE Trans. Inf. Theory 59(12): 7898-7914 (2013) - [c41]Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Correcting combinations of errors and erasures with Euclidean geometry LDPC codes. ISIT 2013: 1685-1689 - [c40]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Separating redundancy of linear MDS codes. ISIT 2013: 1894-1898 - [c39]Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A revolving iterative algorithm for decoding algebraic quasi-cyclic LDPC codes. ISIT 2013: 2656-2660 - [c38]Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Trapping set structure of LDPC codes on finite geometries. ITA 2013: 1-8 - [c37]Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Trapping set structure of LDPC codes on finite geometries. ITA 2013: 1-8 - 2012
- [j55]Jos H. Weber, Vladimir R. Sidorenko, Christian Senger, Khaled A. S. Abdel-Ghaffar:
Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff. Probl. Inf. Transm. 48(4): 324-333 (2012) - [j54]Khaled A. S. Abdel-Ghaffar, Filip Paluncic, Hendrik C. Ferreira
On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction. IEEE Trans. Inf. Theory 58(3): 1804-1808 (2012) - [j53]Filip Paluncic, Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira
A Multiple Insertion/Deletion Correcting Code for Run-Length Limited Sequences. IEEE Trans. Inf. Theory 58(3): 1809-1824 (2012) - [j52]Qin Huang, Qiuju Diao, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets. IEEE Trans. Inf. Theory 58(5): 2648-2671 (2012) - [j51]Qiuju Diao, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A Matrix-Theoretic Approach for Analyzing Quasi-Cyclic Low-Density Parity-Check Codes. IEEE Trans. Inf. Theory 58(6): 4030-4048 (2012) - [c36]Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Trapping set structure of finite geometry LDPC codes. ISIT 2012: 3088-3092 - [c35]Qiuju Diao, Wei Zhou, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A transform approach for constructing quasi-cyclic Euclidean geometry LDPC codes. ITA 2012: 204-211 - [c34]Keke Liu, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Quasi-cyclic LDPC codes: Construction and rank analysis of their parity-check matrices. ITA 2012: 227-233 - 2011
- [j50]Jingyu Kang, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes. IEEE Trans. Commun. 59(1): 64-73 (2011) - [j49]Li Zhang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Zhi Ding
Quasi-Cyclic LDPC Codes on Cyclic Subgroups of Finite Fields. IEEE Trans. Commun. 59(9): 2330-2336 (2011) - [j48]Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Error-Correcting Codes for Flash Coding. IEEE Trans. Inf. Theory 57(9): 6097-6108 (2011) - [c33]Qiuju Diao, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes. ISIT 2011: 366-370 - [c32]Qin Huang, Qiuju Diao, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Trapping sets of structured LDPC codes. ISIT 2011: 1086-1090 - [c31]Qiuju Diao, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A transform approach for analyzing and constructing quasi-cyclic low-density parity-check codes. ITA 2011: 15-22 - [c30]Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Error-correcting codes for flash coding. ITA 2011: 163-185 - [c29]Qin Huang, Qiuju Diao, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Cyclic and quasi-cyclic LDPC codes: New developments. ITA 2011: 186-195 - 2010
- [j47]Li Zhang, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Ian F. Blake:
Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares. IEEE Trans. Commun. 58(11): 3126-3139 (2010) - [j46]Shumei Song, Shu Lin, Khaled A. S. Abdel-Ghaffar, Zhi Ding
Burst decoding of cyclic codes based on circulant parity-check matrices. IEEE Trans. Inf. Theory 56(3): 1038-1047 (2010) - [j45]Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira
Correcting deletions using linear and cyclic codes. IEEE Trans. Inf. Theory 56(10): 5223-5234 (2010) - [c28]Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Flash Coding Scheme Based on Error-Correcting Codes. GLOBECOM 2010: 1-6 - [c27]Li Zhang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Bo Zhou:
Circulant arrays: Rank analysis and construction of quasi-cyclic LDPC codes. ISIT 2010: 814-818 - [c26]Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber:
An upper bound on the separating redundancy of linear block codes. ISIT 2010: 1173-1177 - [c25]Li Zhang, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Ian F. Blake:
Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices. ITA 2010: 16-22 - [i4]Li Zhang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Zhi Ding, Bo Zhou:
Circulant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes. CoRR abs/1004.1184 (2010) - [i3]Qin Huang, Qiuju Diao, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets. CoRR abs/1012.3201 (2010)
2000 – 2009
- 2009
- [j44]Shumei Song, Bo Zhou, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields. IEEE Trans. Commun. 57(1): 84-93 (2009) - [j43]Bo Zhou, Jingyu Kang, Shumei Song, Shu Lin, Khaled A. S. Abdel-Ghaffar, Meina Xu:
Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions - [transactions papers]. IEEE Trans. Commun. 57(6): 1652-1662 (2009) - [j42]Qin Huang, Jingyu Kang, Li Zhang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Two reliability-based iterative majority-logic decoding algorithms for LDPC codes. IEEE Trans. Commun. 57(12): 3597-3606 (2009) - [j41]Hendrik C. Ferreira
Moment balancing templates: constructions to add insertion/deletion correction capability to error correcting or constrained codes. IEEE Trans. Inf. Theory 55(8): 3494-3500 (2009) - 2008
- [j40]Lingqi Zeng, Lan Lan, Ying Yu Tai, Bo Zhou, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: a finite geometry approach. IEEE Trans. Commun. 56(3): 378-387 (2008) - [j39]Lingqi Zeng, Lan Lan, Ying Yu Tai, Shumei Song, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Transactions Papers - Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach. IEEE Trans. Commun. 56(4): 545-554 (2008) - [j38]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators. IEEE Trans. Inf. Theory 54(3): 1368-1374 (2008) - [c24]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Separating erasures from errors for decoding. ISIT 2008: 215-219 - [c23]Bo Zhou, Li Zhang, Jingyu Kang, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Array dispersions of matrices and constructions of quasi-cyclic LDPC codes over non-binary fields. ISIT 2008: 1158-1162 - 2007
- [j37]Jun Xu, Lei Chen, Ivana Djurdjevic, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking. IEEE Trans. Inf. Theory 53(1): 121-134 (2007) - [j36]Lan Lan, Lingqi Zeng, Ying Yu Tai, Lei Chen, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach. IEEE Trans. Inf. Theory 53(7): 2429-2458 (2007) - [j35]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes. IEEE Trans. Inf. Theory 53(9): 3196-3201 (2007) - [c22]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Generalized Iterative Decoding for Linear Block Codes on the Binary Erasure Channel. ISIT 2007: 66-70 - [c21]Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira
On Linear and Cyclic Codes for Correcting Deletions. ISIT 2007: 851-855 - [c20]Hendrik C. Ferreira
Moment Balancing Templates: Universal Constructions to Add Insertion/Deletion Correction Capability to Arbitrary Error Correcting or Constrained Codes. ISIT 2007: 1676-1680 - 2006
- [j34]Ying Yu Tai, Lan Lan, Lingqi Zeng, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Algebraic Construction of Quasi-Cyclic LDPC Codes for the AWGN and Erasure Channels. IEEE Trans. Commun. 54(10): 1765-1774 (2006) - [j33]Khaled A. S. Abdel-Ghaffar, Amr El Abbadi:
The Optimality of Allocation Methods for Bounded Disagreement Search Queries: The Possible and the Impossible. IEEE Trans. Knowl. Data Eng. 18(9): 1194-1206 (2006) - [c19]Lan Lan, Lingqi Zeng, Ying Yu Tai, Lei Chen, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Algebraic Constructions of Quasi-cyclic LDPC Codes - Part I: For AWGN and Binary Random Erasure Channels. AAECC 2006: 255-264 - [c18]Ying Yu Tai, Lingqi Zeng, Lan Lan, Shumei Song, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Algebraic Construction of Quasi-cyclic LDPC Codes - Part II: For AWGN and Binary Random and Burst Erasure Channels. AAECC 2006: 265-274 - [c17]Shumei Song, Lan Lan, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Construction of Quasi-Cyclic LDPC Codes Based on the Primitive Elements of Finite Fields. CISS 2006: 835-838 - [c16]Shumei Song, Shu Lin, Khaled A. S. Abdel-Ghaffar, Zhi Ding
Cyclic Codes for Correcting Bursts of Errors or Erasures With Iterative Decoding. GLOBECOM 2006 - [c15]Shumei Song, Lingqi Zeng, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes. ISIT 2006: 83-87 - [c14]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Stopping Set Enumerators of Full-Rank Parity-Check Matrices of Hamming Codes. ISIT 2006: 1544-1548 - [c13]Shumei Song, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Burst-Correction Decoding of Cyclic LDPC Codes. ISIT 2006: 1718-1722 - [i2]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes. CoRR abs/cs/0603007 (2006) - [i1]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators. CoRR abs/cs/0607024 (2006) - 2005
- [j32]Heng Tang, Jun Xu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Codes on finite geometries. IEEE Trans. Inf. Theory 51(2): 572-596 (2005) - [c12]Lan Lan, Lingqi Zeng, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings. ISIT 2005: 2285-2289 - [c11]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Stopping set analysis for Hamming codes. ITW 2005: 244-247 - [c10]Lingqi Zeng, Lan Lan, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Construction of LDPC codes for AWGN and binary erasure channels based on finite fields. ITW 2005: 273-276 - 2004
- [j31]Lan Lan, Ying Yu Tai, Lei Chen, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes. IEEE Commun. Lett. 8(7): 443-445 (2004) - [j30]Khaled A. S. Abdel-Ghaffar:
A simple derivation of the undetected error probabilities of complementary codes. IEEE Trans. Inf. Theory 50(5): 861-862 (2004) - [j29]Heng Tang, Jun Xu, Yu Kou, Shu Lin, Khaled A. S. Abdel-Ghaffar:
On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes. IEEE Trans. Inf. Theory 50(6): 1269-1279 (2004) - 2003
- [j28]Ivana Djurdjevic, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Graph-theoretic construction of low-density parity-check codes. IEEE Commun. Lett. 7(4): 171-173 (2003) - [j27]Ivana Djurdjevic, Jun Xu, Khaled A. S. Abdel-Ghaffar, Shu Lin:
A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols. IEEE Commun. Lett. 7(7): 317-319 (2003) - [j26]Khaled A. S. Abdel-Ghaffar:
Maximum number of edges joining vertices on a cube. Inf. Process. Lett. 87(2): 95-99 (2003) - [j25]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Reduced GMD decoding. IEEE Trans. Inf. Theory 49(4): 1013-1027 (2003) - [c9]Ivana Djurdjevic, Jun Xu, Khaled A. S. Abdel-Ghaffar, Shu Lin:
A Class of Low-Density Parity-Check Codes Constructed Based on Reed-Solomon Codes with Two Information Symbols. AAECC 2003: 98-107 - 2002
- [j24]Khaled A. S. Abdel-Ghaffar:
Repeated use of codes for error detection five times is bad. IEEE Trans. Inf. Theory 48(7): 2053-2060 (2002) - 2001
- [c8]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Reduced GMD decoding of concatenated codes. GLOBECOM 2001: 901-905 - 2000
- [j23]Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding. IEEE Trans. Inf. Theory 46(4): 1590-1597 (2000) - [j22]Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Constructing efficient DC-free runlength-limited block codes for recording channels. IEEE Trans. Inf. Theory 46(4): 1599-1602 (2000)
1990 – 1999
- 1998
- [j21]Khaled A. S. Abdel-Ghaffar:
Detecting Substitutions and Transpositions of Characters. Comput. J. 41(4): 270-277 (1998) - [j20]Khaled A. S. Abdel-Ghaffar, Amr El Abbadi:
Efficient Detection of Discrepancies in Multiple File Copies. Distributed Comput. 11(2): 59-72 (1998) - [j19]Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira
Systematic Encoding of the Varshamov-Tenengol'ts Codes and the Constantin-Rao Codes. IEEE Trans. Inf. Theory 44(1): 340-345 (1998) - [j18]Khaled A. S. Abdel-Ghaffar, Øyvind Ytrehus:
Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels. IEEE Trans. Inf. Theory 44(4): 1593-1602 (1998) - [c7]Sunil Prabhakar
Efficient retrieval of multidimensional datasets through parallel I/O. HiPC 1998: 375-382 - [c6]Sunil Prabhakar
Cyclic Allocation of Two-Dimensional Data. ICDE 1998: 94-101 - 1997
- [j17]W. C. Ferreira, Willem A. Clarke, Albertus S. J. Helberg
Insertion/deletion correction with spectral nulls. IEEE Trans. Inf. Theory 43(2): 722-732 (1997) - [j16]Khaled A. S. Abdel-Ghaffar:
A lower bound on the undetected error probability and strictly optimal codes. IEEE Trans. Inf. Theory 43(5): 1489-1502 (1997) - [c5]Khaled A. S. Abdel-Ghaffar, Amr El Abbadi:
Optimal Allocation of Two-Dimensional Data. ICDT 1997: 409-418 - 1996
- [j15]Khaled A. S. Abdel-Ghaffar:
On the number of mutually orthogonal partial latin squares. Ars Comb. 42 (1996) - [j14]Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber:
Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation. IEEE Trans. Inf. Theory 42(5): 1405-1424 (1996) - 1995
- [j13]Khaled A. S. Abdel-Ghaffar, Mario Blaum, Jacobus H. Weber:
Analysis of coding schemes for modulation and error control. IEEE Trans. Inf. Theory 41(6): 1955-1968 (1995) - 1994
- [j12]Khaled A. S. Abdel-Ghaffar, Amr El Abbadi:
An Optimal Strategy for Comparing File Copies. IEEE Trans. Parallel Distributed Syst. 5(1): 87-93 (1994) - [c4]Khaled A. S. Abdel-Ghaffar, Amr El Abbadi:
Optimal Detection of a Corrupted Page in a Replicated File. ICDCS 1994: 544-551 - 1993
- [j11]Jacobus H. Weber, Khaled A. S. Abdel-Ghaffar:
Cascading runlength-limited sequences. IEEE Trans. Inf. Theory 39(6): 1976-1984 (1993) - [j10]Khaled A. S. Abdel-Ghaffar, Amr El Abbadi:
Optimal Disk Allocation for Partial Match Queries. ACM Trans. Database Syst. 18(1): 132-156 (1993) - [c3]Khaled A. S. Abdel-Ghaffar, Amr El Abbadi:
Efficient Detection of Corrupted Pages in a Replicated File (Preliminary Report). PODC 1993: 219-227 - 1992
- [j9]Khaled A. S. Abdel-Ghaffar:
On unit constraint-length convolutional codes. IEEE Trans. Inf. Theory 38(1): 200-206 (1992) - [j8]Tsu-Shuan Chang, Khaled A. S. Abdel-Ghaffar:
A universal neural net with guaranteed convergence to zero system error. IEEE Trans. Signal Process. 40(12): 3022-3031 (1992) - 1991
- [j7]Khaled A. S. Abdel-Ghaffar, Martin Hassner:
Multilevel error-control codes for data storage channels. IEEE Trans. Inf. Theory 37(3): 735-741 (1991) - [j6]Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber:
Bounds and constructions for runlength-limited error-control block codes. IEEE Trans. Inf. Theory 37(3): 789-800 (1991) - 1990
- [c2]Khaled A. S. Abdel-Ghaffar, Amr El Abbadi:
On the Optimality of Disk Allocation for Cartesian Product Files. PODS 1990: 258-264
1980 – 1989
- 1989
- [j5]Khaled A. S. Abdel-Ghaffar:
Some convolutional codes whose free distances are maximal. IEEE Trans. Inf. Theory 35(1): 188-191 (1989) - 1988
- [j4]Khaled A. S. Abdel-Ghaffar:
On the existence of optimum cyclic burst correcting codes over GF(q). IEEE Trans. Inf. Theory 34(2): 329-332 (1988) - [j3]Khaled A. S. Abdel-Ghaffar, Robert J. McEliece, Henk C. A. van Tilborg:
Two-dimensional burst identification codes and their use in burst correction. IEEE Trans. Inf. Theory 34(3): 494-504 (1988) - [j2]Fabrizio Pollara, Robert J. McEliece, Khaled A. S. Abdel-Ghaffar:
Finite-state codes. IEEE Trans. Inf. Theory 34(5): 1083-1089 (1988) - 1986
- [j1]Khaled A. S. Abdel-Ghaffar, Robert J. McEliece, Andrew M. Odlyzko, Henk C. A. van Tilborg:
On the existence of optimum cyclic burst-correcting codes. IEEE Trans. Inf. Theory 32(6): 768-775 (1986) - 1984
- [c1]Khaled A. S. Abdel-Ghaffar, Robert J. McEliece:
Soft Error Correction for Increased Densities in VLSI Memories. ISCA 1984: 248-250
Coauthor Index
[j70] [c71] [j69] [c70] [j68] [j66] [c69] [c68] [c67] [c66] [c65] [c64] [c63] [c62] [c61] [c59] [c58] [b1] [j64] [j63] [c57] [c56] [c55] [j62] [j61] [c54] [c53] [c52] [c51] [c50] [j60] [c49] [c48] [c45] [c44] [c43] [c42] [j59] [j56] [c41] [c39] [c38] [c37] [j52] [j51] [c36] [c35] [c34] [j50] [j49] [j48] [c33] [c32] [c31] [c30] [c29] [j47] [j46] [c28] [c27] [c25] [i4] [i3] [j44] [j43] [j42] [j40] [j39] [c23] [j37] [j36] [j34] [c19] [c18] [c17] [c16] [c15] [c13] [j32] [c12] [c10] [j31] [j29] [j28] [j27] [c9]
Jos H. Weber
aka: Jacobus H. Weber
aka: Jacobus H. Weber
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-17 20:28 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: