Abstract
A new class of error-correcting codes, with random and burst error correcting capability is described. The main features of this code are: (1) The codec can be used for random, burst and ARQ encoding. When used for burst error correction it operates at the theoretical maximum efficiency as defined by the Reiger Bound. Any rate code is readily obtained. (2) Extreme simplicity of design of the decoder as well as the encoder. For example, the decoding algorithm is of significantly less complexity than that of the Viterbi algorithm for the same error rate performance. (3) When used for ARQ, the codec is less complex and provides a higher throughput for the same error rate than other ARQ coding systems, such as Chase's Code Combiner. (4) The code is adaptive, i.e., the rate can be changed through the use of side information. The decoder can also readily be changed adaptively. (5) The code can be used for M-ary PSK and M-ary QAM transmission using symbol encoding and decoding and maintain ease of implementation.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
