The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Khaled A. S. Abdel-Ghaffar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Khaled A. S. Abdel-Ghaffar, Amr El Abbadi
    Optimal Disk Allocation for Partial Match Queries. [Citation Graph (12, 10)][DBLP]
    ACM Trans. Database Syst., 1993, v:18, n:1, pp:132-156 [Journal]
  2. Sunil Prabhakar, Khaled A. S. Abdel-Ghaffar, Divyakant Agrawal, Amr El Abbadi
    Cyclic Allocation of Two-Dimensional Data. [Citation Graph (5, 8)][DBLP]
    ICDE, 1998, pp:94-101 [Conf]
  3. Khaled A. S. Abdel-Ghaffar, Amr El Abbadi
    Optimal Allocation of Two-Dimensional Data. [Citation Graph (5, 18)][DBLP]
    ICDT, 1997, pp:409-418 [Conf]
  4. Khaled A. S. Abdel-Ghaffar, Amr El Abbadi
    On the Optimality of Disk Allocation for Cartesian Product Files. [Citation Graph (2, 6)][DBLP]
    PODS, 1990, pp:258-264 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    AAECC, 2003, pp:98-107 [Conf]
  6. Lan Lan, Lingqi Zeng, Ying Y. 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. [Citation Graph (0, 0)][DBLP]
    AAECC, 2006, pp:255-264 [Conf]
  7. Ying Y. 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. [Citation Graph (0, 0)][DBLP]
    AAECC, 2006, pp:265-274 [Conf]
  8. Khaled A. S. Abdel-Ghaffar, Amr El Abbadi
    Optimal Detection of a Corrupted Page in a Replicated File. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1994, pp:544-551 [Conf]
  9. Khaled A. S. Abdel-Ghaffar, Robert J. McEliece
    Soft Error Correction for Increased Densities in VLSI Memories. [Citation Graph (0, 0)][DBLP]
    ISCA, 1984, pp:248-250 [Conf]
  10. Khaled A. S. Abdel-Ghaffar, Amr El Abbadi
    Efficient Detection of Corrupted Pages in a Replicated File (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:219-227 [Conf]
  11. Khaled A. S. Abdel-Ghaffar
    On the number of mutually orthogonal partial latin squares. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  12. Khaled A. S. Abdel-Ghaffar
    Detecting Substitutions and Transpositions of Characters. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1998, v:41, n:4, pp:270-277 [Journal]
  13. Khaled A. S. Abdel-Ghaffar, Amr El Abbadi
    Efficient Detection of Discrepancies in Multiple File Copies. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1998, v:11, n:2, pp:59-72 [Journal]
  14. Khaled A. S. Abdel-Ghaffar
    Maximum number of edges joining vertices on a cube. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:2, pp:95-99 [Journal]
  15. Khaled A. S. Abdel-Ghaffar
    Repeated use of codes for error detection five times is bad. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:7, pp:2053-2060 [Journal]
  16. Khaled A. S. Abdel-Ghaffar
    A simple derivation of the undetected error probabilities of complementary codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:5, pp:861-862 [Journal]
  17. Khaled A. S. Abdel-Ghaffar
    On the existence of optimum cyclic burst correcting codes over GF(q). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:2, pp:329-0 [Journal]
  18. Khaled A. S. Abdel-Ghaffar
    Some convolutional codes whose free distances are maximal. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:1, pp:188-0 [Journal]
  19. Khaled A. S. Abdel-Ghaffar
    On unit constraint-length convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:1, pp:200-0 [Journal]
  20. Khaled A. S. Abdel-Ghaffar
    A lower bound on the undetected error probability and strictly optimal codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1489-1502 [Journal]
  21. Khaled A. S. Abdel-Ghaffar, Mario Blaum, Jacobus H. Weber
    Analysis of coding schemes for modulation and error control. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1955-1968 [Journal]
  22. Khaled A. S. Abdel-Ghaffar, Martin Hassner
    Multilevel error-control codes for data storage channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:735-741 [Journal]
  23. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:6, pp:768-775 [Journal]
  24. Khaled A. S. Abdel-Ghaffar, Robert J. McEliece, Henk C. A. van Tilborg
    Two-dimensional burst identification codes and their use in burst correction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:3, pp:494-504 [Journal]
  25. Khaled A. S. Abdel-Ghaffar, Jos H. Weber
    Constructing efficient DC-free runlength-limited block codes for recording channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1599-1602 [Journal]
  26. Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber
    Bounds and constructions for runlength-limited error-control block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:789-800 [Journal]
  27. Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber
    Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1405-1424 [Journal]
  28. Khaled A. S. Abdel-Ghaffar, Øyvind Ytrehus
    Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1593-1602 [Journal]
  29. Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira
    Systematic Encoding of the Varshamov-Tenengol'ts Codes and the Constantin-Rao Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:340-345 [Journal]
  30. W. C. Ferreira, W. A. Clarke, Albertus S. J. Helberg, Khaled A. S. Abdel-Ghaffar, A. J. Han Vinck
    Insertion/deletion correction with spectral nulls. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:2, pp:722-732 [Journal]
  31. Fabrizio Pollara, Robert J. McEliece, Khaled A. S. Abdel-Ghaffar
    Finite-state codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1083-0 [Journal]
  32. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1269-1279 [Journal]
  33. Heng Tang, Jun Xu, Shu Lin, Khaled A. S. Abdel-Ghaffar
    Codes on finite geometries. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:2, pp:572-596 [Journal]
  34. Jos H. Weber, Khaled A. S. Abdel-Ghaffar
    Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1590-1597 [Journal]
  35. Jos H. Weber, Khaled A. S. Abdel-Ghaffar
    Reduced GMD decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:4, pp:1013-1027 [Journal]
  36. Jacobus H. Weber, Khaled A. S. Abdel-Ghaffar
    Cascading runlength-limited sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:6, pp:1976-0 [Journal]
  37. Jun Xu, Lei Chen, Ivana Djurdjevic, Shu Lin, Khaled A. S. Abdel-Ghaffar
    Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:1, pp:121-134 [Journal]
  38. Khaled A. S. Abdel-Ghaffar, Amr El Abbadi
    The Optimality of Allocation Methods for Bounded Disagreement Search Queries: The Possible and the Impossible. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2006, v:18, n:9, pp:1194-1206 [Journal]
  39. Khaled A. S. Abdel-Ghaffar, Amr El Abbadi
    An Optimal Strategy for Comparing File Copies. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:1, pp:87-93 [Journal]
  40. Shumei Song, Shu Lin, Khaled A. S. Abdel-Ghaffar, Zhi Ding, Marc P. C. Fossorier
    Cyclic Codes for Correcting Bursts of Errors or Erasures With Iterative Decoding. [Citation Graph (0, 0)][DBLP]
    GLOBECOM, 2006, pp:- [Conf]
  41. Khaled A. S. Abdel-Ghaffar, Jos H. Weber
    Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  42. Jos H. Weber, Khaled A. S. Abdel-Ghaffar
    Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  43. Circulant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002