Professor

Electrical and Computer Engineering

University of California, Davis

Department of Electrical and Computer Engineering

University of California

Davis, California 95616

Department Fax: 530-752-8428

email: ghaffar

ECE Department Faculty Profile Page

Khaled A. S. Abdel-Ghaffar received the B.Sc. degree from Alexandria University, Alexandria, Egypt, in 1980, and the M.S. and Ph.D. degrees from the California Institute of Technology, Pasadena, CA, in 1983 and 1986, respectively, all in electrical engineering. In 1988, Dr. Abdel-Ghaffar joined the University of California, Davis, where he is now a Professor of Electrical and Computer Engineering. He did research at the IBM Almaden Research Center, San Jose, CA, Delft University of Technology, The Netherlands, University of Bergen, Norway, and Alexandria University, Egypt. His main interest is coding theory. Dr. Abdel-Ghaffar served as an Associate Editor for Coding Theory for the IEEE Transactions on Information Theory from 2002 to 2005 and he is currently serving as an Associate Editor for Algebraic and LDPC Codes for the IEEE Transactions on Communications. He is a co-recipient of the IEEE Communications Society 2007 Stephen O. Rice Prize paper award.

**Journal Publications:**

- K. A. S. Abdel-Ghaffar, R. J. McEliece, A. Odlyzko, and H. C. A. van Tilborg,

On the existence of optimum cyclic burst-correcting codes,

*IEEE Transactions on Information Theory*, vol. IT-32, pp. 768-775, November 1986. - K. A. S. Abdel-Ghaffar,

On the existance of optimum cyclic burst correcting codes over GF(q),

*IEEE Transactions on Information Theory*, vol. 34, pp. 329-332, March 1988. - K. A. S. Abdel-Ghaffar, R. J. McEliece, and H. C. A. van Tilborg,

Two-dimensional burst identification codes and their use in burst correction,

*IEEE Transactions on Information Theory*, vol. 34, pp. 494-504, May 1988. - F. Pollara, R. J. McEliece, and K. Abdel-Ghaffar,

Finite state codes,

*IEEE Transactions on Information Theory*, vol. 34, pp. 1083-1089, part 1, September 1988. - K. A. S. Abdel-Ghaffar,

Some convolutional codes whose free distances are maximal,

*IEEE Transactions on Information Theory*, vol. 35, pp. 188-191, January 1989. - K. A. S. Abdel-Ghaffar,

The number of convolutional codes of span one,

*Computers & Mathematics with Applications*, vol. 21, pp. 33-38, 1991. - K. A. S. Abdel-Ghaffar and M. Hassner,

Multilevel error-control codes for data storage channels,

*IEEE Transactions on Information Theory*, vol. 37, pp. 735-741, May 1991. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Bounds and constructions for runlength-limited error-control block codes,

*IEEE Transactions on Information Theory*, vol. 37, pp. 789-800, May 1991. - K. A. S. Abdel-Ghaffar,

On unit constraint-length convolutional codes,

*IEEE Transactions on Information Theory*, vol. 38, pp. 200-206, January 1992. - T. S. Chang and K. A. S. Abdel-Ghaffar,

A universal neural net with guaranteed convergence to zero system error,

*IEEE Transactions on Signal Processing*, vol. 40, pp. 3022-3031, December 1992. - K. A. S. Abdel-Ghaffar,

Capacity per unit cost of a discrete memoryless channel,

*Electronics Letters*, vol. 29, pp. 142-144, 21st January 1993. - K. A. S. Abdel-Ghaffar and A. El Abbadi,

Optimal disk allocation for partial match queries,

*ACM Transactions on Database Systems*, vol. 18, pp. 132-156, March 1993. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Cascading runlength-limited sequences,

*IEEE Transactions on Information Theory*, vol. 39, pp. 1976-1984, November 1993. - K. A. S. Abdel-Ghaffar and A. El Abbadi,

An optimal strategy for comparing file copies,

*IEEE Transactions on Parallel and Distributed Systems*, vol. 5, pp. 87-93, January 1994. - K. A. S. Abdel-Ghaffar, M. Blaum, and J. H. Weber,

Analysis of coding schemes for modulation and error control,

*IEEE Transactions on Information Theory*, vol. 41, pp. 1955-1968, November 1995. - K. A. S. Abdel-Ghaffar,

On the number of mutually orthogonal partial latin squares,

*Ars Combinatoria*, vol. 42, pp. 256-286, 1996. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation,

*IEEE Transactions on Information Theory*, vol. 42, pp. 1405-1424, September 1996. - H. C. Ferreira, W. A. Clarke, A. S. J. Helberg, K. A. S. Abdel-Ghaffar, and A. J. Han Vinck,

Insertion/deletion correction with spectral nulls,

*IEEE Transactions on Information Theory*, vol. 43, pp. 722-732, March 1997. - K. A. S. Abdel-Ghaffar,

A lower bound on the undetected error probability and strictly optimal codes,

*IEEE Transactions on Information Theory*, vol. 43, pp. 1489-1502, September 1997. - K. A. S. Abdel-Ghaffar and H. C. Ferreira,

Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin-Rao codes,

*IEEE Transactions on Information Theory*, vol. 44, pp. 340-345, January 1998. - K. A. S. Abdel-Ghaffar and A. El Abbadi,

Efficient detection of discrepancies in multiple file copies,

*Distributed Computing*, vol. 11, pp. 59-72, April 1998. - K. A. S. Abdel-Ghaffar and O. Ytrehus,

Difference set codes: Codes with squared Euclidean distance of six for partial response channels,

*IEEE Transactions on Information Theory*, vol. 44, pp. 1593-1602, July 1998. - K. A. S. Abdel-Ghaffar,

Long division for Laurent series matrices and the optimal assignment problem,

*Linear Algebra and Its Applications*, vol. 280, pp. 189-197, 1998. - K. A. S. Abdel-Ghaffar,

Detecting substitutions and transpositions of characters,

*The Computer Journal*, vol. 41, pp. 270-277, 1998. - K. A. S. Abdel-Ghaffar,

Partial fraction evaluation of rational z-transforms,

*Electronics Letters*, vol. 35, pp. 623-624, 15th April 1999. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding,

*IEEE Transactions on Information Theory*, vol. 46, pp. 1590-1597, July 2000. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Constructing efficient dc-free runlength-limited block codes for recording channels,

*IEEE Transactions on Information Theory*, vol. 46, pp. 1599-1602, July 2000. - K. A. S. Abdel-Ghaffar,

The determinant of random power series matrices over finite fields,

*Linear Algebra and Its Applications*, vol. 315, pp. 139-144, 2000. - M. Hassner, K. Abdel-Ghaffar, A. Patel, R. Koetter, and B. Trager,

Integrated interleaving: A novel ECC Architecture,

*IEEE Transactions on Magnetics*, vol. 37, pp. 773-775, March 2001. - K. A. S. Abdel-Ghaffar,

Repeated use of codes for error detection five times is bad,

*IEEE Transactions on Information Theory*, vol. 48, pp. 2053-2060, July 2002. - K. A. S. Abdel-Ghaffar,

Maximum number of edges joining vertices on a cube,

*Information Processing Letters*, vol. 87, pp. 95-99, 2003. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Reduced GMD decoding,

*IEEE Transactions on Information Theory*, vol. 49, pp. 1013-1027, April 2003. - I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar,

Graph-theoretic construction of low-density parity-check codes,

*IEEE Communication Letters*, vol. 7, pp. 171-173, April 2003. - I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin,

A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols,

*IEEE Communication Letters*, vol. 7, pp. 317-319, July 2003. - K. A. S. Abdel-Ghaffar,

A simple derivation of the undetected error-probabilities of complementary codes,

*IEEE Transactions on Information Theory*, vol. 50, pp. 861-862, May 2004. - H. Tang, J. Xu, Y. Kou, S. Lin, and K. Abdel-Ghaffar,

On algebraic construction of Gallager and circulant low-density parity-check codes,

*IEEE Transactions on Information Theory*, vol. 50, pp. 1269-1279, June 2004. - L. Lan, Y. Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar,

A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes,

*IEEE Communication Letters*, vol. 8, pp. 443-445, July 2004. - H. Tang, J. Xu, S. Lin, and K. A. S. Abdel-Ghaffar,

Codes on finite geometries,

*IEEE Transactions on Information Theory*, vol. 51, pp. 572-596, February 2005. - K. A. S. Abdel-Ghaffar and A. El Abbadi,

The optimality of allocation methods for bounded disagreement search queries: The possible and the impossible,

*IEEE Transactions on Knowledge and Date Engineering*, vol. 18, pp. 1194-1206, September 2006. - Y. Y. Tai, L. Lan, L. Zeng, S. Lin, and K. A. S. Abdel-Ghaffar,

Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels,

*IEEE Transactions on Communications*, vol. 54, pp. 1765-1774, October 2006. - J. Xu, L. Chen, I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar,

Construction of regular and irregular LDPC codes: Geometry decomposition and masking,

*IEEE Transactions on Information Theory*, vol. 53, pp. 121-134, January 2007. - L. Lan, L. Zeng, Y. Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar,

Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: A finite field approach,

*IEEE Transactions on Information Theory*, vol. 53, pp. 2429-2458, July 2007. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Complete enumeration of stopping sets of full-rank parity-check matrices of Hamming codes,

*IEEE Transactions on Information Theory*, vol. 53, pp. 3196-3201, September 2007. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Results on parity-check matrices with optimal stopping and/or dead-end set enumerators,

*IEEE Transactions on Information Theory*, vol. 54, pp. 1368-1374, March 2008. - L. Zeng, L. Lan, Y. Y. Tai, B. Zhou, S. Lin, and K. A. S. Abdel-Ghaffar,

Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach,

*IEEE Transactions on Communications*, vol. 56, pp. 378-387, March 2008. - L. Zeng, L. Lan, Y. Y. Tai, S. Song, S. Lin, and K. Abdel-Ghaffar,

Constructions of nonbinary quasi-cyclic LDPC codes: A finite field approach,

*IEEE Transactions on Communications*, vol. 56, pp. 545-554, April 2008. - S. Song, B. Zhou, S. Lin, and K. Abdel-Ghaffar,

A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields,

*IEEE Transactions on Communications*, vol. 57, pp. 84-93, January 2009. - B. Zhou, J. Kang, S. Song, S. Lin, K. Abdel-Ghaffar, and M. Xu,

Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions,

*IEEE Transactions on Communications*, vol. 57, pp. 1652-1662, June 2009. - H. C. Ferreira, K. A. S. Abdel-Ghaffar, L. Cheng, T. G. Swart, K.
Ouahada,

Moments balancing templates: Constructions to add insertion/deletion correction capability to error correcting or constrained codes,

*IEEE Transactions on Information Theory*, vol. 55, pp. 3494-3500, August 2009. - Q. Huang, J. Kang, L. Zhang, S. Lin, and K. Abdel-Ghaffar,

Two reliability-based iterative majority-logic decoding algorithms for LDPC codes,

*IEEE Transactions on Communications*, vol. 57, pp. 3597-3606, December 2009. - S. Song, S. Lin, K. Abdel-Ghaffar, Z. Ding, W. H. Fong, and M. P. C. Fossorier,

Burst decoding of cyclic codes based on circulant parity-check matrices,

*IEEE Transactions on Information Theory*, vol. 56, pp. 1038-1047, March 2010. - K. A. S. Abdel-Ghaffar, H. C. Ferreira, and L. Cheng,

Correcting deletions using linear and cyclic codes,

*IEEE Transactions on Information Theory*, vol. 56, pp. 5223-5234, October 2010. - L. Zhang; Q. Huang, S. Lin, K. Abdel-Ghaffar, and I. F. Blake,

Quasi-Cyclic LDPC Codes: An algebraic construction, rank analysis, and codes on Latin squares,

*IEEE Transactions on Communications*, vol. 58, pp. 3126-3139, November 2010. - J. Kang, Q. Huang, S. Lin, and K. Abdel-Ghaffar,

An iterative decoding algorithm with backtracking to lower the error-floors of LDPC codes,

*IEEE Transactions on Communications*, vol. 59, pp. 64 - 73, January 2011. - L. Zhang, S. Lin, K. Abdel-Ghaffar, Z. Ding, and B. Zhou,

Quasi-cyclic LDPC codes on cyclic subgroups of finite fields,

*IEEE Transactions on Communications*, vol. 59, pp. 2330 - 2336, September 2011. - Q. Huang, S. Lin, and K. A. S. Abdel-Ghaffar,

Error-correcting codes for flash coding,

*IEEE Transactions on Information Theory*, vol. 57, pp. 6097-6108, September 2011. - K. A. S. Abdel-Ghaffar,

Counting matrices over finite fields having a given number of rows of unit weight,

*Linear Algebra and Its Applications*, vol. 436, pp. 2665-2669, 2012. - K. A. S. Abdel-Ghaffar, F. Palunicic, H. C. Ferreira, W. A. Clarke,

On Helberg's generalization of the Levenshtein code for multiple deletion/insertion error correction,

*IEEE Transactions on Information Theory*, vol. 58, no. 3, pp. 1804-1808, March 2012. - F. Palunicic, K. A. S. Abdel-Ghaffar, H. C. Ferreira, W. A. Clarke,

A multiple insertion/deletion correcting code for run-length limited sequences,

*IEEE Transactions on Information Theory*, vol. 58, no. 3, pp. 1809-1824, March 2012. - Q. Huang, Q. Diao, S. Lin, and K. Abdel-Ghaffar,

Cyclic and quasi-cyclic LDPC codes on constrained parity-check matrices and their trapping sets,

*IEEE Transactions on Information Theory*, vol. 58, no. 5, pp. 2648-2671, May 2012. - Q. Diao, Q. Huang, S. Lin, and K. Abdel-Ghaffar,

A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes,

*IEEE Transactions on Information Theory*, vol. 58, no. 6, pp. 4030-4048, June 2012. - J. H. Weber, V. R. Sidorenko, C. Senger, and K. A. S. Abdel-Ghaffar

Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff, (English translation),

*Problems of Information Transmission*, vol. 48. no. 4, pp. 324-333, 2012.

(Original Russian published in*Problemy Peredachi Informatsii*, vol. 48, no. 4, pp. 30-40, 2012.) - K. A. S. Abdel-Ghaffar and J. H. Weber,

Parity-check matrices separating erasures from errors,

*IEEE Transactions on Information Theory*, vol. 59, no. 6, pp. 3332-3346, 2013.

**Conference Publications:** - K. Abdel-Ghaffar and R. J. McEliece,

Soft-error correction for increased densities in VLSI memories,

Proceedings of the 11th Annual International Symposium on Computer Architecture,

Ann Arbor, MI, pp. 248-250, June 5-7, 1984. - K. Abdel-Ghaffar, R. J. McEliece, and H. C. A. van Tilborg,

Two-dimensional burst identification codes,

Abstracts of the IEEE International Symposium on Information Theory,

Brighton, England, p. 31, June 24-28, 1985. - K. A. S. Abdel-Ghaffar, R. J. McEliece, A. Odlyzko, and H. C. A. van Tilborg,

Optimum binary cyclic burst correcting codes,

Abstracts of the IEEE International Symposium on Information Theory,

Ann Arbor, MI, p. 153, October 6-9, 1986. - K. A. S. Abdel-Ghaffar,

Some convolutional codes whose free distances are maximal,

Abstracts of the IEEE International Symposium on Information Theory,

Kobe, Japan, p. 48, June 19-24, 1988. - K. A. S. Abdel-Ghaffar and A. El Abbadi,

On the optimality of disk allocation for cartesian product files,

Proceedings of the 9th ACM Symposium on Principles of Database Systems,

Nashville, TN, pp. 258-264, April 2-4, 1990. - J. H. Weber and K. A. S. Abdel-Ghaffar,

A class of runlength-limited error detecting codes,

Proceedings of the 11th Symposium on Information Theory in the Benelux,

Noordwijkerhout, The Netherlands, pp. 22-28, October 25 & 26, 1990. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Methods for cascading runlength-limited sequences,

Proceedings of the 12th Symposium on Information Theory in the Benelux,

Veldhoven, The Netherlands, pp. 95-101, May 23 & 24, 1991. - T. S. Chang and K. Abdel-Ghaffar,

A universal self-growing feedforward neural net with guaranteed success for supervised learning,

Proceedings of the 9th International Symposium on Mathematical Theory of Networks and Systems,

Kobe, Japan, pp. 451-456, June 17-21, 1991. - K. A. S. Abdel-Ghaffar, R. J. McEliece, and G. Solomon,

Some partial unit memory convolutional codes,

Proceedings of the International Symposium on Information Theory,

Budapest, Hungary, p. 196, June 24-28, 1991. - J. H. Weber and K. A. S. Abdel-Ghaffar,

On cascading runlength-limited sequences,

Proceedings of the International Symposium on Information Theory,

Budapest, Hungary, p. 227, June 24-28, 1991. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Merging bits for cascading runlength-limited sequences,

Proceedings of the 13th Symposium on Information Theory in the Benelux,

Enshede, The Netherlands, pp. 65-72, June 1 & 2, 1992. - M. Hassner, G. Fettweis, K. Abdel-Ghaffar, and C. J. Williamson,

Algebraic signal processing in truncated p-adic arithmetic for linear channels with memory,

Proccedings of the IEEE International Conference on Communications,

Chicago, IL, pp. 313.3.1-4, June 14-18, 1992. - M. Hassner, G. Fettweis, K. Abdel-Ghaffar, and C. J. Williamson,

Algebraic signal processing for spectral zero constrained channels,

Proceedings of the International Workshop on Algebraic and Combinatorial Coding,

Voneshta Voda, Bulgaria, pp. 84-87, June 22-28, 1992. - K. A. S. Abdel-Ghaffar, M. Blaum and J. H. Weber,

A scheme for combined modulation and error correction,

Proceedings of the International Symposium on Information Theory,

San Antonio, TX, p. 125, January 17-22, 1993. - K. A. S. Abdel-Ghaffar and A. El Abbadi,

Efficient detection of corrupted pages in a replicated file,

Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing,

Ithaca, New York, pp. 219-227, August 15-18, 1993. - K. A. S. Abdel-Ghaffar and A. El Abbadi,

Optimal detection of a corrupted page in a replicated file,

Proceedings of the 14th International Conference on Distributed Computing Systems,

Poznan, Poland, pp. 544-551, June 21-24, 1994. - K. A. S. Abdel-Ghaffar, M. Blaum, and J. H. Weber,

The performance of different concatenated coding schemes for the noisy (1,7) constrained channel,

Proceedings of the International Symposium on Information Theory,

Trondheim, Norway, p. 148, June 27-July 1, 1994. - K. A. S. Abdel-Ghaffar and A. El Abbadi,

Comparing multiple file copies using minimal communication,

Proceedings of the International Symposium on Information Theory,

Trondheim, Norway, p. 171, June 27-July 1, 1994. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Constrained block codes for partial-response maximum-likelihood channels,

Proceedings of the 16th Symposium on Information Theory in the Benelux,

Nieuwerkerk a/d Ijssel, The Netherlands, pp. 177-183, May 18 & 19, 1995. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Constrained block codes for class-IV PRML channels,

Proceedings of the International Symposium on Information Theory,

Whistler, British Columbia, Canada, p. 143, September 17-22, 1995. - K. A. S. Abdel-Ghaffar,

A lower bound on the undetected error probability of block codes,

Proceedings of the International Symposium on Information Theory,

Whistler, British Columbia, Canada, p. 341, September 17-22, 1995. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Strictest (0,G/I) constraints achieved by high-rate block codes for class-IV PRML channels,

Proceedings of SPIE Conference on Coding and Signal Processing for Information Storage,

Philadelphia, Pennsylvania, pp. 276-285, October 23-24, 1995. - H. C. Ferreira, K. A. S. Abdel-Ghaffar, and A. J. van Hinck,

On insertion/deletion correction,

Proceedings of the 1996 International Symposium on Information Theory and Its Applications,

Victoria, British Columbia, Canada, pp. 47-50, September 17-20, 1996. - K. A. S. Abdel-Ghaffar and A. El Abbadi,

Optimal allocation of two-dimensional data,

Proceedings of the International Conference on Database Theory,

Delphi, Greece, pp. 409-418, January 8-10, 1997. - K. A. S. Abdel-Ghaffar,

Achieving the Reiger bound for burst errors using two-dimensional interleaving schemes,

Proceedings of the International Symposium on Information Theory,

Ulm, Germany, p. 425, June 24-July 4, 1997. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Optimal decoding strategy for a simple concatenated coding scheme,

Proceedings of the International Symposium on Information Theory,

Ulm, Germany, p. 429, June 24-July 4, 1997. - K. A. S. Abdel-Ghaffar and H. C. Ferreira,

On the maximum number of systematically-encoded information bits in the Varshamov-Tenengol'ts codes and the Constantin-Rao codes,

Proceedings of the International Symposium on Information Theory,

Ulm, Germany, p. 455, June 24-July 4, 1997. - K. A. S. Abdel-Ghaffar and O. Ytrehus,

Difference set codes for (1-D) partial response channels,

Proceedings of the International Symposium on Information Theory,

Ulm, Germany, p. 460, June 24-July 4, 1997. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Constructing DC-free runlength-limited block codes,

Proceedings of the IEEE Information Theory Workshop,

Longyearbyen, Norway, pp. 29-30, July 6-12, 1997. - S. Prabhakar, K. Abdel-Ghaffar, D. Agrawal, and A. El Abbadi,

Cyclic allocation of two-dimensional data,

Proceedings of the 14th International Conference on Data Engineering,

Orlando, Florida, pp. 94-101, February 23-27, 1998. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Inner decoder optimization in a simple concatenated coding scheme with single-trial decoding,

Proceedings of the 19th Symposium on Information Theory in the Benelux,

Veldhoven, The Netherlands, pp. 67-74, May 28 & 29, 1998. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Achieving the optimal guaranteed error correction rate in a simple concatenated coding scheme with single-trial decoding,

Proceedings of the International Symposium on Information Theory,

Cambridge, Massachusetts, p. 335, August 16-21, 1998. - J. H. Weber and K. A. S. Abdel-Ghaffar,

On the unsuccessful decoding probability for a simple concatenated coding scheme with single-trial decoding,

Proceedings of IEEE GLOBECOM,

Sydney, Australia, pp. 839-844, November 8-12, 1998. - S. Prabhakar, K. Abdel-Ghaffar, D. Agrawal, and A. El Abbadi,

Efficient retrieval of multidimensional datasets through parallel I/O,

Proceedings of the International Conference on High Performance Computing,

Chennai, India, pp. 375-382, December 17-20, 1998. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Error correction capabilities of concatenated coding schemes with single-trial bounded distance decoding and optimized erazing,

Proceedings of the 20th Symposium on Information Theory in the Benelux,

Haasrode, Belgium, pp. 219-226, May 27-28, 1999. - K. A. S. Abdel-Ghaffar and Jos H. Weber,

Asymptotic results for concatenated coding schemes with single-trial bounded distance decoding and optimized erazing,

Proceedings of the 1999 IEEE Information Theory and Communications Workshop,

Kruger National Park, South Africa, p. 116, June 20-25, 1999. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Single-trial generalized minimum distance decoding,

Proceedings of the 21st Symposium on Information Theory in the Benelux,

Wassenaar, The Netherlands, pp. 1-8, May 25 & 26, 2000. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Limited-trial generalized minimum distance decoding with fixed erasing,

Proceedings of the International Symposium on Information Theory,

Sorrento, Italy, p. 395, June 25-30, 2000. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Error-correction radius of reduced GMD decoders,

Proceedings of the 22nd Symposium on Information and Communication Theory in the Benelux,

Enshede, The Netherlands, pp. 107-114, May 15 & 16, 2001. - K. A. S. Abdel-Ghaffar and Jos H. Weber,

Reduced GMD decoding with threshold erasing,

Proceedings of the International Symposium on Information Theory,

Washington, DC, p. 256, June 24-29, 2001. - H. Tang, Y. Kou, J. Xu, S. Lin, and K. Abdel-Ghaffar,

Codes on finite geometries: Old, new, majority-logic and iterative decodings,

Proceedings of the 6th International Symposium on Communications Theory and Applications,

Ambleside, UK, pp. 381-386, July 15-20, 2001. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Performance analysis of reduced GMD decoders,

Proceedings of the International Symposium on Telecommunications,

Tehran, Iran, pp. 325-328, September 1-3, 2001. - S. Lin, H. Tang, Y. Kou, J. Xu, and K. Abdel-Ghaffar,

Codes on finite geometries,

Proceedings of the IEEE Information Theory Workshop,

Cairns, Australia, pp. 14-16, September 2-7, 2001. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Reduced GMD decoding of concatenated codes,

Proceedings of IEEE GLOBECOM,

San Antonio, TX, pp. 901-905, November 25-29, 2001. - D. Copsey, M. Oskin, F. T. Chung, I. Chuang, and K. Abdel-Ghaffar,

Memory hierarchies for quantum data,

Proceedings of 1st Workshop on Non-Silicon Computation, Cambridge, MA, pp. 62-69, February 3, 2002. - I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar,

On a graph-theoretic construction of low density parity check codes,

Proceedings of the 36th Annual Conference on Information Sciences and Systems (CISS),

Princeton University, Princeton, NJ, March 20-22, 2002. - Y. Kou, J. Xu, H. Tang, S. Lin, and K. Abdel-Ghaffar,

On circulant low density parity check codes,

Proceedings of the International Symposium on Information Theory,

Lausanne, Switzerland, p. 200, June 30-July 5, 2002. - J. Xu, H. Tang, Y. Kou, S. Lin, and K. Abdel-Ghaffar,

A general class of LDPC finite geometry codes and their performance,

Proceedings of the International Symposium on Information Theory,

Lausanne, Switzerland, p. 309, June 30-July 5, 2002. - H. Tang, J. Xu, Y. Kou, S. Lin, and K. Abdel-Ghaffar,

On algebraic construction of Gallager low density parity check codes,

Proceedings of the International Symposium on Information Theory,

Lausanne, Switzerland, p. 482, June 30-July 5, 2002. - I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin,

A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols,

Proceedings of the 15th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-15),

Toulouse, France, pp. 98-107, May 12-16, 2003. - I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar,

Graph-theoretic construction of low-density parity-check codes,

Proceedings of the International Symposium on Information Theory,

Yokohama, Japan, p. 31, June 29-July 4, 2003. - L. Chen, I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar,

Construction of quasi-cyclic LDPC codes based on the minimum weight codewords of Reed-Solomon codes,

Proceedings of the International Symposium on Information Theory,

Chicago, IL, p. 239, June 27-July 2, 2004. - L. Chen, L. Lan, I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar,

An algebraic method for constructing quasi-cyclic LDPC codes,

Proceedings of the International Symposium on Information Theory and its Applications,

Parma, Italy, pp. 535-539, October 10-13, 2004. - Y. Y. Tai, L. Lan, L. Zeng, S. Lin, and K. Abdel-Ghaffar,

Algebraic constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels,

Proceedings of the 39th Annual Conference on Information Sciences and Systems (CISS),

The John Hopkins University, Baltimore, MD, 6 pages, March 16-18, 2005. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Stopping and dead-end set enumerators for binary Hamming codes,

Proceedings of the 26th Symposium on Information Theory in the Benelux,

Brussels, Belgium, pp. 165-172, May 19 & 20, 2005. - Y. Y. Tai, L. Lan, L. Zeng, L. Chen, S. Lin, and K. Abdel-Ghaffar,

Construction of structured LDPC codes for AWGN and binary erasure channels,

Proceedings of WirelessCom Symposium on Information Theory,

Maui, Hawaii, pp. 146-151, June 13-16, 2005. - J. H. Weber and K. A. S. Abdel-Ghaffar,

Stopping set analysis for Hamming codes,

Proceedings of the Information Theory Workshop on Coding and Complexity,

Rotorua, New Zealand, pp. 244-247, August 28-September 1, 2005. - L. Zeng, L. Lan, Y. Y. Tai, S. Lin, and K. Abdel-Ghaffar,

Construction of LDPC codes for AWGN and binary erasure channels based on finite fields,

Proceedings of the Information Theory Workshop on Coding and Complexity,

Rotorua, New Zealand, pp. 273-276, August 28-September 1, 2005. - L. Lan, L. Zeng, Y. Y. Tai, S. Lin, and K. Abdel-Ghaffar,

Constructions of quasi-cyclic LDPC codes for AWGN and binary erasure channels based on finite fields and affine mappings,

Proceedings of the International Symposium on Information Theory,

Adelaide, South Australia, Australia, pp. 2285-2289, September 4-9, 2005. - L. Lan, L. Zeng, Y. Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar,

Algebraic constructions of quasi-cyclic LDPC codes-Part I: For AWGN and binary random erasure channels,

Proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16,

Las Vegas, Nevada, Springer Lecture Notes in Computer Science, LNCS 3857, pp. 255-264, February 20-24, 2006. - Y. Y. Tai, L. Zeng, L. Lan, S. Song, S. Lin, and K. Abdel-Ghaffar,

Algebraic constructions of quasi-cyclic LDPC codes-Part II: For AWGN and binary random and burst erasure channels,

Proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16,

Las Vegas, Nevada, Springer Lecture Notes in Computer Science, LNCS 3857, pp. 265-274, February 20-24, 2006. - S. Song, S. Lin, and K. Abdel-Ghaffar,

Cyclic LDPC codes for burst correction,

Proceedings of the IEICE Technical Committee on Information Theory Conference,

Nagoya, Japan, pp. 159-164, March 16-17, 2006. - S. Song, L. Lan, S. Lin, and K. Abdel-Ghaffar,

Construction of quasi-cyclic LDPC codes based on the primitive elements of finite fields,

Annual Conference on Information Sciences and Systems (CISS),

Princeton, NJ, pp. 835-838, March 22 - 24, 2006. - K. A. S. Abdel-Ghaffar and J. H. Weber,

On parity-check matrices with optimal stopping and/or dead-end set enumerators,

Proceedings of the International Symposium on Turbo Codes & Related Topics,

Munich, Germany, 6 pages, April 3-7, 2006. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Enumeration of stopping sets of full-rank parity-check matrices of Hamming codes,

Proceedings of the 27th Symposium on Information Theory in the Benelux,

Noordwijk, The Netherlands, pp. 61-68, June 8 & 9, 2006. - S. Song, L. Zeng, S. Lin, and K. Abdel-Ghaffar,

Algebraic constructions of nonbinary quasi-cyclic LDPC codes,

Proceedings of the International Symposium on Information Theory,

Seattle, WA, pp. 83-87, July 9-14, 2006. - K. Abdel-Ghaffar and J. H. Weber,

Stopping set enumerators of full-rank parity-check matrices of Hamming codes,

Proceedings of the International Symposium on Information Theory,

Seattle, WA, pp. 1544-1548, July 9-14, 2006. - S. Song, S. Lin, and K. Abdel-Ghaffar,

Burst-correction decoding of cyclic LDPC codes,

Proceedings of the International Symposium on Information Theory,

Seattle, WA, pp. 1718-1722, July 9-14, 2006. - J. H. Weber and K. A. S. Abdel-Ghaffar,

On decoding failure probabilities for linear block codes on the binary erasure channel,

Proceedings of the IEEE International Theory Workshop,

Chengdu, China, pp. 24-28, October 22-26, 2006. - S. Song, S. Lin, K. Abdel-Ghaffar, Z. Ding, and M. Fossorier,

Cyclic codes for correcting bursts of errors or erasures with iterative decoding,

Proceedings of IEEE GLOBECOM,

San Francisco, CA, 5 pages, November 27 - December 1, 2006. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Generalized stopping sets and stopping redundancy,

Proceedings of the Information Theory and Applications Workshop,

San Diego, CA, 5 pages, January 29 - February 2, 2007. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Generalized iterative decoding for linear block codes on the binary erasure channel,

Proceedings of the International Symposium on Information Theory,

Nice, France, pp. 66-70, June 24-29, 2007. - K. A. S. Abdel-Ghaffar, H. C. Ferreira, and L. Cheng,

On linear and cyclic codes for correcting deletions,

Proceedings of the International Symposium on Information Theory,

Nice, France, pp. 851-855, June 24-29, 2007. - H. C. Ferreira, K. A. S. Abdel-Ghaffar, L. Cheng, and T. G. Swart,

Moment balancing templates: Universal constructions to add insertion/deletion correction capability to arbitrary error correcting or constrained codes,

Proceedings of the International Symposium on Information Theory,

Nice, France, pp. 1676-1680, June 24-29, 2007. - J. Kang, B. Zhou, S. Song, S. Lin, and K. Abdel-Ghaffar,

Construction of high performance and efficiently encodable nonbinary qusi-cyclic LDPC codes based on finite fields,

Proceedings of the 9th International Symposium on Communications Theory and Applications,

Ambleside, UK, 18 pages, July 16-20, 2007. - S. Song, S. Lin, K. Abdel-Ghaffar, and W. H. Fong,

Erasure-burst and error-burst decoding of linear codes,

Proceedings of the IEEE Information Theory Workshop,

Tahoe City, CA, pp. 132-137, September 2 - 6, 2007. - K. A. S. Abdel-Ghaffar and J. H. Weber,

Separating erasures from errors for decoding,

Proceedings of the International Symposium on Information Theory,

Toronto, Canada, pp. 215-219, July 6-11, 2008. - B. Zhou, L. Zhang, J. Kang, Q. Huang, S. Lin, and K. Abdel-Ghaffar,

Array dispersions of matrices and constructions of quasi-cyclic LDPC codes over non-binary fields,

Proceedings of the International Symposium on Information Theory,

Toronto, Canada, pp. 1158-1162, July 6-11, 2008. - Q. Huang, J. Kang, L. Zhang, S. Lin, and K. Abdel-Ghaffar,

An efficient and low-complexity iterative reliability-based majority-logic decoding algorithm for LDPC codes,

Proceedings of the Information Theory and Applications Workshop,

San Diego, CA, 10 pages, February 8 - 13, 2009. - N. M. Tri, J. H. Weber, and K. A. S. Abdel-Ghaffar,

New upper bounds on the separating redundancy of linear block codes,

Proceedings of the Thirtieth Symposium on Information Theory in the Benelux,

Eindhoven, The Netherlands, pp. 209 - 216, May 28-29, 2009. - Q. Huang, J. Kang, L. Zhang, S. Lin and K. Abdel-Ghaffar,

Two efficient and low-complexity iterative reliability-based majority-logic decoding algorithms for LDPC codes,

Proceedings of the IEEE Information Theory Workshop,

Taormina, Sicely, Italy, pp. 253-257, October 11 - 16, 2009. - L. Zhang, Q. Huang, S. Lin, K. Abdel-Ghaffar, and I. F. Blake,

Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices,

Proceedings of the Information Theory and Applications Workshop,

San Diego, CA, 7 pages, January 31 - February 5, 2010. - L. Zhang, S. Lin, K. Abdel-Ghaffar, and B. Zhou,

Circulant arrays: Rank analysis and construction of quasi-cyclic LDPC codes,

Proceedings of the International Symposium on Information Theory,

Austin, TX, pp. 814-818, July 13-18, 2010. - K. A. S. Abdel-Ghaffar and J. H. Weber,

An upper bound on the separating redundancy of linear block codes,

Proceedings of the International Symposium on Information Theory,

Austin, TX, pp. 1173-1177, July 13-18, 2010. - Q. Huang, S. Lin, and K. Abdel-Ghaffar,

Flash coding scheme based on error-correcting codes,

Proceedings of IEEE GLOBECOM,

Miami, FL, 6 pages, December 6 - 10, 2010. - Q. Diao, Q. Huang, S. Lin, and K. Abdel-Ghaffar,

A transform approach for analyzing and constructing quasi-cyclic low-density parity-check codes,

Proceedings of the Information Theory and Applications Workshop,

San Diego, CA, 8 pages, February 6 - 11, 2011. - Q. Huang, Q. Diao, S. Lin, and K. Abdel-Ghaffar,

Cyclic and quasi-cyclic LDPC codes: New Developments,

Proceedings of the Information Theory and Applications Workshop,

San Diego, CA, 10 pages, February 6 - 11, 2011. - Q. Diao, Q. Huang, S. Lin, K. Abdel-Ghaffar,

A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes,

Proceedings of the International Symposium on Information Theory,

Saint Petersburg, Russia, pp. 366-370, July 31 - August 5, 2011. - Q. Huang, Q. Diao, S. Lins, and K. Abdel-Ghaffar

Trapping sets of structured LDPC codes,

Proceedings of the International Symposium on Information Theory,

Saint Petersburg, Russia, pp. 1086-1090, July 31 - August 5, 2011. - Q. Diao, W. Zhou, S. Lin, and K. Abdel-Ghaffar,

A transform approach for constructing quasi-cyclic Euclidean geometry codes,

Proceedings of the Information Theory and Applications Workshop,

San Diego, CA, 8 pages, February 5 - 10, 2012. - K. Liu, Q. Huang, S. Lin, and K. Abdel-Ghaffar,

Quasi-cyclic LDPC codes: Construction and rank analysis of their parity-check matrices,

Proceedings of the Information Theory and Applications Workshop,

San Diego, CA, 7 pages, February 5 - 10, 2012. - Q. Diao, Y. Y. Tai, S. Lin, and K. Abdel-Ghaffar,

Trapping set structure of finite geometry LDPC codes,

Proceedings of the International Symposium on Information Theory,

Cambridge, MA, pp. 3088-3092, July 1 - 6, 2012. - Q. Diao, Y. Y. Tai, S. Lin, and K. Abdel-Ghaffar,

Trapping set structure of LDPC codes on finite geometries,

Proceedings of the Information Theory and Applications Workshop,

San Diego, CA, 8 pages, February 10 - 15, 2013. - K. Liu, Q. Huang, S. Lin, and K. Abdel-Ghaffar,

A complexity-reduced iterative algorithm for decoding cyclic finite geometry LDPC codes,

Proceedings of the Information Theory and Applications Workshop,

San Diego, CA, 9 pages, February 10 - 15, 2013.

**Miscellaneous Publications:** - F. Pollara, R. J. McEliece, and K. Abdel-Ghaffar,

Constructions for finite-state codes,

in The Telecommunications and Data Acquisition Progress Report, NASA, Jet Propulsion Laboratory,

Pasadena, CA, pp. 42-49, April-June 1987. - K. Abdel-Ghaffar and R. J. McEliece,

The ultimate limits of information density,

in Performance Limits in Communication Theory and Practice,

Edited by J. K. Skwirzynski, Kluwer Academic Publishers, pp. 267-279, 1988. - K. Abdel-Ghaffar and M. A. Hassner,

Methods and means for correcting random and burst errors,

United States Patent No. 4,951,284, issued August 21, 1990. - K. A. S. Abdel-Ghaffar,

Digital Signal Processing: Applications to Communications and Algebraic Coding Theory, by S. D. Morgera and H. Krishna, a book review,

IEEE Communications Magazine, vol. 28, p. 75, November 1990. - K. A. S. Abdel-Ghaffar, R. J. McEliece, and G. Solomon,

Some partial-unit-memory convolutional codes,

in The Telecommunications and Data Acquisition Progress Report, NASA, Jet Propulsion Laboratory,

Pasadena, CA, pp. 57-72, November 1991.