1 citations · 1 across the 1 of their papers we have counts for
6 papers · 1 filter
On the Weight Distribution of the Extended Quadratic Residue Code of Prime 137
C. Tjhai, M. Tomlinson, M. Ambroze +1
The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-even code…
A New Non-Iterative Decoding Algorithm for the Erasure Channel : Comparisons with Enhanced Iterative Methods
J. Cai, C. Tjhai, M. Tomlinson +2
This paper investigates decoding of binary linear block codes over the binary erasure channel (BEC). Of the current iterative decoding algorithms on this channel, we review the Rec…
Improved Iterative Decoding for Perpendicular Magnetic Recording
E. Papagiannis, C. Tjhai, M. Ahmed +2
An algorithm of improving the performance of iterative decoding on perpendicular magnetic recording is presented. This algorithm follows on the authors' previous works on the paral…
Near Maximum-Likelihood Performance of Some New Cyclic Codes Constructed in the Finite-Field Transform Domain
C. Tjhai, M. Tomlinson, R. Horan +2
It is shown that some well-known and some new cyclic codes with orthogonal parity-check equations can be constructed in the finite-field transform domain. It is also shown that, fo…
Idempotents, Mattson-Solomon Polynomials and Binary LDPC codes
R. Horan, C. Tjhai, M. Tomlinson +2
We show how to construct an algorithm to search for binary idempotents which may be used to construct binary LDPC codes. The algorithm, which allows control of the key properties o…
GF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets
C. Tjhai, M. Tomlinson, R. Horan +2
Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2^m), where m>0 cyclic low-density parity-check codes.…