Letter: Analysis of concatenated reed-solomon encoding schemes with full and partial interleaving for short data messages
暂无分享,去创建一个
A concatenation of Reed-Solomon and repetition codes with symbol interleaving is considered for applications in which the message length is limited and the probability of incorrect received symbols is high. An analysis is developed with reference to a Packet Radio Network, using Spread Spectrum modulation, simultaneously affected by random errors and burst emors. The results obtained are compared with those derived by numerical simulation. It is shown that a canonical formulation can be used for the case of full interleavers, but it cannot be applied to encoding schemes with partial interleavers. In the latter situation a modified, improved, approach is proposed.
[1] John L. Ramsey. Realization of optimum interleavers , 1970, IEEE Trans. Inf. Theory.
[2] Franco Chiaraluce,et al. Error Correcting Schemes With Non-optimum Interleaving For Packet Radio Networks , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.
[3] Larry A. Dunning. Encoding and decoding for the minimization of message symbol error rates in linear block codes , 1987, IEEE Trans. Inf. Theory.
[4] Don J. Torrieri. The Information-Bit Error Rate for Block Codes , 1984, IEEE Trans. Commun..