A fast algorithm for computing distance spectrum of convolutional codes
作者： M.L. Cedervall , R. Johannesson
DOI: 10.1109/18.45271
关键词: Serial concatenated convolutional codes 、 Concatenated error correction code 、 Reed–Solomon error correction 、 Mathematics 、 Code rate 、 Linear code 、 Encoding (memory) 、 Turbo code 、 Algorithm 、 Convolutional code
摘要: A fast algorithm for searching a tree (FAST) is presented computing the distance spectrum of convolutional codes. The profile code used to limit substantially error patterns that have be searched. can easily modified determine number nonzero information bits an incorrect path as well length event. For testing systematic codes, faster version given. FAST much than standard bidirectional search. On microVAX, d/sub infinity /=27 was verified rate R=1/2, memory M=25 in 37 s CPU time. Extensive tables R=1/2 encoders are Several listed spectra superior those any previously known codes same and memory. conjecture 2M will perform nonsystematic M given strong support. >
core.ac.uk
sci-hub.se 参考文章(18)
James L. Massey, Error Bounds for Tree Codes, Trellis Codes, and Convolutional Codes with Encoding and Decoding Procedures Coding and Complexity. pp. 1- 57 ,(1975) , 10.1007/978-3-7091-3008-7_1
J. H. Griesmer, A Bound for Error-Correcting Codes IBM Journal of Research and Development. ,vol. 4, pp. 532- 542 ,(1960) , 10.1147/RD.45.0532
R. Johannesson, E. Paaske, Further results on binary convolutional codes with an optimum distance profile (Corresp.) IEEE Transactions on Information Theory. ,vol. 24, pp. 264- 268 ,(1978) , 10.1109/TIT.1978.1055850
R. Johannesson, Robustly optimal rate one-half binary convolutional codes (Corresp.) IEEE Transactions on Information Theory. ,vol. 21, pp. 464- 468 ,(1975) , 10.1109/TIT.1975.1055397
J. Bussgang, Some properties of binary convolutional code generators IEEE Transactions on Information Theory. ,vol. 11, pp. 90- 100 ,(1965) , 10.1109/TIT.1965.1053723
H. Helgert, Correction to "Short Constraint Length Rate 1/2 ́Quick-Looḱ Codes" IEEE Transactions on Communications. ,vol. 24, pp. 286- 286 ,(1976) , 10.1109/TCOM.1976.1093281
K. Larsen, Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al. IEEE Transactions on Information Theory. ,vol. 19, pp. 577- 579 ,(1973) , 10.1109/TIT.1973.1055028
J.L. MasseyY, M.K. Sain, Inverses of Linear Sequential Circuits IEEE Transactions on Computers. ,vol. C-17, pp. 330- 337 ,(1968) , 10.1109/TC.1968.229392
R. Johannesson, Some long rate one-half binary convolutional codes with an optimum distance profile (Corresp.) IEEE Transactions on Information Theory. ,vol. 22, pp. 629- 631 ,(1976) , 10.1109/TIT.1976.1055599
H. Helgert, Short Constraint Length Rate 1/2 "Quick-Look" Codes IEEE Transactions on Communications. ,vol. 23, pp. 768- 773 ,(1975) , 10.1109/TCOM.1975.1092866