Add to ORKGsuch that there exists a binary convolutional code of block length �, dimension � 0 �, constraint length #, and free distance �����, is studied. For � ��� � P �QY R�, codes are obtained from simple constructions that determine x@�Y #Y �����A for all positive integers # and �. Codes with minimum Hamming distance � ��� � ! S are found by computer search. A number of new codes, with specified constraint lengths, redundancies, and free distances, and higher code rates than previously reported codes, are presented
Several algorithms for constructing convolutional codes using block codes are given. The minimum dis...
AbstractWe look at convolutional codes with maximum possible code length for prescribed redundancy, ...
AbstractThe maximum length of all zero sequences in the codewords of a convolutional code is present...
We provide useful results on two classes of convolutional codes: binary codes and nonbinary codes. T...
Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal acc...
New rate-compatible convolutional (RCC) codes with high constraint lengths and a wide range of code ...
The class of error-correcting convolutional codes is commonly used for reliable data transmission in...
The minimum distance of a code is an important measure of robustness of the code since it provides a...
A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all l...
Maximum distance separable (MDS) block codes and MDS 1D convolutional codes are the most robust code...
[[abstract]]Summary form only given. The authors let the number of fundamental paths of weight d in ...
Rate 1/2 binary convolutional codes are analyzed and a lower bound on free distance in terms of the ...
Abstract-A tabulation of binary ljrstematic convolutional codes with an optimum distance profile for...
Three optimality criteria for convolutional codes are considered in this correspondence: namely, fre...
Two constructions of unit-memory binary convolutional codes from linear block codes over the finite ...
Several algorithms for constructing convolutional codes using block codes are given. The minimum dis...
AbstractWe look at convolutional codes with maximum possible code length for prescribed redundancy, ...
AbstractThe maximum length of all zero sequences in the codewords of a convolutional code is present...
We provide useful results on two classes of convolutional codes: binary codes and nonbinary codes. T...
Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal acc...
New rate-compatible convolutional (RCC) codes with high constraint lengths and a wide range of code ...
The class of error-correcting convolutional codes is commonly used for reliable data transmission in...
The minimum distance of a code is an important measure of robustness of the code since it provides a...
A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all l...
Maximum distance separable (MDS) block codes and MDS 1D convolutional codes are the most robust code...
[[abstract]]Summary form only given. The authors let the number of fundamental paths of weight d in ...
Rate 1/2 binary convolutional codes are analyzed and a lower bound on free distance in terms of the ...
Abstract-A tabulation of binary ljrstematic convolutional codes with an optimum distance profile for...
Three optimality criteria for convolutional codes are considered in this correspondence: namely, fre...
Two constructions of unit-memory binary convolutional codes from linear block codes over the finite ...
Several algorithms for constructing convolutional codes using block codes are given. The minimum dis...
AbstractWe look at convolutional codes with maximum possible code length for prescribed redundancy, ...
AbstractThe maximum length of all zero sequences in the codewords of a convolutional code is present...