t the performance of such codes, when compared with interleaved block codes, offers better results at significantly lower cost.22:T505,We derive a new family of convolutional character-error-correcting codes which are a convolutional form of the Reed-Solomon block codes and as such have nonbinary symbols. We also derive a bound on the error correcting capabilities of these codes in which the error-correcting capability per constraint length grows approximately with the square root of the constraint length. When these codes are used on a binary channel they are effective for both random and burst error correction because a single character spans several channel digits. These codes have greater error-correcting capabilities than the Robinson-Bernstein self-orthogonal codes but are harder to decode. The single-character-error-correcting codes, when interleaved, are shown to be more powerful than the equivalent Hagelbarger code and appear to be simpler to implement. They are also slightly better than the interleaved version of Berlekamp's code. We discuss encoding and decoding algorithms and illustrate a simple decoding algorithm for some of the codes. These codes are closely related to the Bose-Chaudhuri-Hocquenghem block codes and share with them the decoding simplification for character erasures in place of errors. Any Bose-Chaudhuri-Hocquenghem decoding algorithm can be used to decode these codes.23:T505,The burst-trapping error control technique developed by Tong [1] corrects both random and burst errors adaptively. A generalization of this scheme, called generalized burst trapping (GBT), is presented here. Generalized burst-trapping codes (GBTC) also correct both random and burst errors adaptively but, in addition, are capable of correcting random errors in the guard space following a correctable burst. This added capability is obtained at the expense of a longer guard space or a lower rate and a modest increase in complexity of implementation. Nevertheless, these codes are simple to encode and decode and, in particular, the storage-saving technique used with the original burst-trapping codes is directly applicable to the generalized codes. Also it is shown that at most one block of error propagation can occur if a simple and reasonable condition is met. Thus the generalized codes have better propagation properties than the original burst-trapping codes. This new error control technique is well suited to error correction on channels where it cannot be assumed that bursts are isolated events separated by error-free intervals. Thus, for example, this technique appears well suited to error correction on telephone facilities that incorporate multiple-level signaling.24:T4cb,It is shown that every linear cyclic b -burst-error-correcting code over any finite field can be modified to correct up to (b-2) symbols of synchronization slippage without additional redundancy, while maintaining its additive error-correcting capability in the absence of synchronization errors. For codes that are interleaved to a degree m , the synchronization error-correcting capability is m (b-1) - 1 symbols, where b \geq 3 is the length of the burst each subcode corrects. This technique gives an optimum burst-error-correcting code a synchronization error-corecfing capability that is only one symbol short of the known upper bound and is hence asymptotically optimal. Moreover, the implementation is very simple.

#	Concept	H-Index	Publications	Citations
1	Engineering	7	7	125
2	Computer Engineering	7	7	125
3	Computer Science	7	7	125
4	Systems Engineering	2	2	24
5	Physics	1	1	26

	Year	Citations

About

Top Concepts