In this paper we present tables of convolutional codes with an optimum bidirectional distance profile (OBDP), defined as the minimum of the distance profiles of the code and its corresponding "reverse" code. Such codes minimize the average complexity of bidirectional sequential decoding algorithms. The computer search is accelerated by the facts that optimum distance profile (ODP) codes of larger memory must have ODP codes of smaller memory as their "prefixes", and that OBDP codes can be obtained by "concatenating" ODP and reverse ODP codes of smaller memory.

翻译：在本文中,我们列出了具有最佳双向距离剖面图(OBDP)的革命代码表,其定义是该代码及其相应的“反向”代码的最小距离剖面图及其相应的“反向”代码,这些代码最大限度地减少了双向相继解码算法的平均复杂性,计算机搜索加速了以下事实,即较大内存的最佳距离剖面图(ODP)代码必须具有小内存的ODP代码作为其“前缀”,而OBDP代码可以通过“加固”ODP代码和小内存的反向ODP代码获得。