13 citations · 14 across the 6 of their papers we have counts for
6 papers · 1 filter
Convolutional Codes from Cyclic Codes with Guaranteed Free and Local Minimum Distances
Khaled Abdel-Ghaffar, Daniel J. Costello, Juane Li +1
This paper presents an algebraic method to construct convolutional codes with guaranteed \emph{free and local minimum distances} without limit based on cyclic codes of odd lengths.…
A Global Coding Scheme for OFDM over Finite Fields
Juane Li, Qi-yue Yu, Khaled Abdel-Ghaffar +1
This paper proposes a highly efficient global coded-multiplexing scheme, conceptualized as Orthogonal Frequency Division Multiplexing over a finite field (FF-OFDM), for reliable mu…
Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets
Qin Huang, Qiuju Diao, Shu Lin +1
This paper is concerned with construction and structural analysis of both cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of three parts. The first part shows t…
Circulant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes
Li Zhang, Shu Lin, Khaled Abdel-Ghaffar +2
This paper consists of three parts. The first part presents a large class of new binary quasi-cyclic (QC)-LDPC codes with girth of at least 6 whose parity-check matrices are constr…
Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End Set Enumerators
Jos H. Weber, Khaled A. S. Abdel-Ghaffar
The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanne…
Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
Khaled A. S. Abdel-Ghaffar, Jos H. Weber
Stopping sets, and in particular their numbers and sizes, play an important role in determining the performance of iterative decoders of linear codes over binary erasure channels.…