A new method to design good unit-memory convolutional codes is presented. It is based on the decomposition of the original problem into two easier subproblems, which can be formulated as optimization problems and solved by new efficient heuristic search algorithms. The efficacy of the new method is demonstrated by a table containing 33 new unit-memory convolutional codes (n, k) with 5 ≤ k ≤ 8, rates R = k/n between 1/4 and 7/9, and complete memory (M = k), as well as 12 new linear block codes. Most of the new codes found have maximum free distance.3931100110
Two constructions of unit-memory binary convolutional codes from linear block codes over the finite ...
In this paper we present the analytical results of the computational requirement for the minimum-dis...
The minimum distance of a code is an important measure of robustness of the code since it provides a...
We can provide unequal error protection (UEP) by the properties of convolutional code encoder. The o...
such that there exists a binary convolutional code of block length �, dimension � 0 �, constraint le...
New rate-compatible convolutional (RCC) codes with high constraint lengths and a wide range of code ...
In this paper we will introduce a specific class of cyclic convolutional codes. The construction is ...
AbstractIn this paper a recently developed combinatorial optimisation technique known as tabu search...
Several algorithms for constructing convolutional codes using block codes are given. The minimum dis...
Code design problems are central in information theory and have applications in different fields ran...
Convolutional codes are essential in a wide range of practical applications due to their efficient n...
Abstract—The free distance of (n, k, l) convolutional codes has some connection with the memory leng...
The Bidirectional Efficient Algorithm for Searching code Trees (BEAST), which is an algorithm to eff...
Three optimality criteria for convolutional codes are considered in this correspondence: namely, fre...
The class of error-correcting convolutional codes is commonly used for reliable data transmission in...
Two constructions of unit-memory binary convolutional codes from linear block codes over the finite ...
In this paper we present the analytical results of the computational requirement for the minimum-dis...
The minimum distance of a code is an important measure of robustness of the code since it provides a...
We can provide unequal error protection (UEP) by the properties of convolutional code encoder. The o...
such that there exists a binary convolutional code of block length �, dimension � 0 �, constraint le...
New rate-compatible convolutional (RCC) codes with high constraint lengths and a wide range of code ...
In this paper we will introduce a specific class of cyclic convolutional codes. The construction is ...
AbstractIn this paper a recently developed combinatorial optimisation technique known as tabu search...
Several algorithms for constructing convolutional codes using block codes are given. The minimum dis...
Code design problems are central in information theory and have applications in different fields ran...
Convolutional codes are essential in a wide range of practical applications due to their efficient n...
Abstract—The free distance of (n, k, l) convolutional codes has some connection with the memory leng...
The Bidirectional Efficient Algorithm for Searching code Trees (BEAST), which is an algorithm to eff...
Three optimality criteria for convolutional codes are considered in this correspondence: namely, fre...
The class of error-correcting convolutional codes is commonly used for reliable data transmission in...
Two constructions of unit-memory binary convolutional codes from linear block codes over the finite ...
In this paper we present the analytical results of the computational requirement for the minimum-dis...
The minimum distance of a code is an important measure of robustness of the code since it provides a...