Tailbiting codes obtained via convolutional codes with large active distance-slopes
Tóm tắt
The slope of the active distances is an important parameter when investigating the error-correcting capability of convolutional codes and the distance behavior of concatenated convolutional codes. The slope of the active distances is equal to the minimum average weight cycle in the state-transition diagram of the encoder. A general upper bound on the slope depending on the free distance of the convolutional code and new upper bounds on the slope of special classes of binary convolutional codes are derived. Moreover, a search technique, resulting in new tables of rate R=1/2 and rate R=1/3 convolutional encoders with high memories and large active distance-slopes is presented. Furthermore, we show that convolutional codes with large slopes can be used to obtain new tailbiting block codes with large minimum distances. Tables of rate R=1/2 and rate R=1/3 tailbiting codes with larger minimum distances than the best previously known quasi-cyclic codes are given. Two new tailbiting codes also have larger minimum distances than the best previously known binary linear block codes with same size and length. One of them is also superior in terms of minimum distance to any previously known binary nonlinear block code with the same set of parameters.
Từ khóa
#Convolutional codes #Error correction coding #Concatenated coding #Search methodsTài liệu tham khảo
hole, 1997, tight bounds on the minimum average weight per branch for rate <formula><tex>$(n-1)/n$</tex></formula> convolutional codes, IEEE Trans Information Theory, 43, 1301, 10.1109/18.605599
hole, 1997, a note on asymptotically catastrophic convolutional codes of rate <formula><tex>$(n-1/n)$</tex></formula>, IEEE Transactions on Communications, 45, 1014, 10.1109/26.623061
10.1109/ISIT.2000.866385
10.1137/0137027
10.1109/18.971744
handlery, 0, a distance measure tailored to tailbiting codes, Probl Inform Transm (Probl Pered Inform )
10.1109/18.212301
litsyn, 0, Table of nonlinear binary codes
berlekamp, 1984, Algebraic Coding Theory
golomb, 1982, Shift Register Sequences
10.1109/ISIT.2001.936075
10.1109/18.771145
handlery, 2002, encoder and distance properties of woven convolutional codes with one tailbiting component code, Probl Inform Transm (Probl Pered Inform ), 38
10.1109/TIT.1976.1055519
10.1109/9780470544693
10.1109/TIT.2004.834780
10.1016/S0019-9958(68)90947-9
10.1109/18.971745
10.1109/TIT.1980.1056194
10.1109/18.749009
peterson, 1972, Error-Correcting Codes
10.1109/18.705580
10.1109/18.79911
10.1109/TIT.1970.1054538
chen, 2000, new results on binary quasi-cyclic codes, Proc IEEE Int Symp on Information Theory
10.1109/TCOM.1986.1096498
heijnen, 1998, the decoding of binary quasi-cyclic codes, Communication and Coding, 146