Systematic construction of optimal linear recurrent codes for burst error correction
Tóm tắt
A method is presented for the construction of binary linear burst error correcting recurrent codes of type B2, viz. those codes which correct any burst of lengthl=rb or less provided it is confined amongr successive blocks of lengthb. The proposed codes are optimal in the sense they meet the lower bound obtained by Wyner and Ash, and are constructed through a particular bordering of the characteristic matrices of analogous codes of shorter block length. Finally, existing linear recurrent codes are compared for efficiency.
Tài liệu tham khảo
P. Elias, «Coding for Noisy Channels»,IRE Int. Conv., 4 (1955) 37–46.
D. W. Hagelbarger, «Recurrent Codes: Easily Mechanized, Burst-Correcting Binary Codes»,Bell Sys. Tech. Jour., 38 (1959) 969–984.
W. L. Kilmer, «Linear Recurrent Binary Error-Correcting Codes for Memoryless Channels»,IRE Trans. PGIT, 7 (1961), 7–13.
W. W. Peterson, «Error Correcting Codes», the M.I.T. Press, Cambridge, Mass., and John Wiley and Sons, New York, N. Y., 1961.
A. D. Wyner andR. B. Ash, «Analysis of Recurrent Codes», IEEE Trans. PGIT, 9 (1963), 143–156.