Some new disjoint Golomb rulers
IEEE Transactions on Information Theory
An Analysis of the Orthogonality Structures of Convolutional Codes for Iterative Decoding
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A new class of convolutional self-doubly orthogonal codes which can be decoded by an iterative threshold decoder is presented. This new type of codes, called Simplified Convolutional Self-Doubly Orthogonal Codes (S-CSO2C), are obtained by simplifying some of the conditions on the double orthogonality of the Convolutional Self-Doubly Orthogonal Codes (CSO2C). The relaxing of these conditions yields a substantial reduction of the total decoding delay induced by the memory length of the convolutional encoder at a cost of any a small degradation of the error performances. These simplified codes are also amenable to high coding rates R = b/(b + 1), b 1 by puncturing a rate 1/2 systematic convolutional encoder. These new simplified CSO2C provide an interesting alternative for low complexity implementation error correcting schemes.