5 January 2012 in IEEE Transactions on Information Theory
In an earlier transactions paper, Rosnes and Ytrehus presented an efficient algorithm for determining all stopping sets of low-density parity-check (LDPC) codes, up to a specified weight, and also gave results for a number of well-known codes including the family of IEEE 802.16e LDPC codes, commonly referred to as the WiMax codes. It is the purpose of this short paper to review the algorithm for determining the initial part of the stopping set weight spectrum (which includes the codeword weight spectrum), and to provide some improvements to the algorithm. As a consequence, complete stopping set weight spectra up to weight 32 (for selected IEEE 802.16e LDPC codes) can be provided, while in previous work only stopping set weights up to 28 are reported. In the published standard for the IEEE 802.16e codes there are two methods of construction presented, depending upon the code rate and the code length. We compare the stopping sets of the resulting codes and provide complete stopping set weight spectra (up to five terms) for all IEEE 802.16e LDPC codes using both construction methods.
11 July 2014 in IEEE Transactions on Information Theory
In this paper, we study the minimum/stopping distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m q. In the literature, the minimum/stopping distance of these codes (denoted by d(q, m) and h(q, m), respectively) has been thoroughly studied for m 5. Both exact results, for small values of q and m, and general (i.e., independent of q) bounds have been established. For m = 6, the best known minimum distance upper bound, derived by Mittelholzer, is d(q, 6) 32. In this paper, we derive an improved upper bound of d(q, 6) 20 and a new upper bound d(q, 7) 24 by using the concept of a template support matrix of a codeword/stopping set. The bounds are tight with high probability in the sense that we have not been able to find codewords of strictly lower weight for several values of q using a minimum distance probabilistic algorithm. Finally, we provide new specific minimum/stopping distance results for m 7 and low-to-moderate values of q ≤79.
1 January 2003 in IEE Proceedings - Vision, Image, and Signal Processing
The paper describes a high-capacity blind video watermarking system invariant to geometrical attacks such as shift, rotation, scaling and cropping. A spatial domain reference watermark is used to obtain invariance to geometric attacks by employing image registration techniques to determine and invert the attacks. A second, high-capacity watermark, which carries the data payload, is embedded in the wavelet domain according to a human visual system model. This is protected by a state-of-the-art error correction code (turbo code). For a false detection probability of 10−8, the proposed system is invariant to scaling up to 180%, rotation up to 70°, and arbitrary aspect ratio changes up to 200% on both axes. Furthermore, the system is virtually invariant to any shifting, cropping, or combined shifting and cropping. The system is also robust to MPEG2 compression, even when combined with shifting and cropping.
1 July 2014 in IET Communications
Traditionally, codes are designed for an error correcting system to combat noisy transmission channels and achieve reliable communication. These codes can be used in syndrome coding, but it is shown in this study that the best performance is achieved with codes specifically designed for syndrome coding. In the view of the security of the communication, the best codes are the codes, which have the highest value of an information secrecy metric, the equivocation rate, for a given code length and code rate and are well packed codes. A code design technique is described, which produces the best binary linear codes for the syndrome coding scheme. An efficient recursive method to determine the equivocation rate for the binary symmetric channel and any linear binary code is also presented. A large online database of best equivocation codes for the syndrome coding scheme has been produced using the code design technique with some examples presented in the study. The presented results show that the best equivocation codes produce a higher level of secrecy for the syndrome coding scheme than almost all best known error correcting codes. Interestingly, it is unveiled that some outstanding best known error correcting codes are also best equivocation codes.
17 March 2005 in Electronics Letters
It is shown that idempotents based on cyclotomic cosets may be used to construct some new one-step majority-logic codes. The construction method produces the dual code idempotent which can be used to directly define the parity-check matrix of the cyclic code. A feature of the cyclotomic idempotent codes is the incremental approach to the sparseness of the parity-check matrix and the property of parity-check bit orthogonality which is known to be useful in belief-propagation decoding. These codes have high minimum distance and a performance 0.4 dB away from the theoretical limit is demonstrated.