## Abstract

A search procedure is developed to find good short binary(N,N - 1)convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distanced_{free}either cannot achieve the maximum value or is equal tod_{free}of some code in the remaining set. Farther, the search among the remaining codes is started in a subset in which we expect the possibility of finding codes with large values ofd_{free}to be good. A number of short, optimum (in the sense of maximizingd_{free}), rate-2/3 and 3/4 codes found by the search procedure are listed.

Original language | English |
---|---|

Journal | I E E E Transactions on Information Theory |

Volume | 20 |

Issue number | 5 |

Pages (from-to) | 683-689 |

ISSN | 0018-9448 |

Publication status | Published - 1974 |