Pulse Explore Journal Club Debates Trending Researchers Journals

Join discussions, follow papers, and never miss your next session.

Download on theApp Store

Home Explore Journal Club Trending

⌘+K

An efficient algorithm for computing free distance (Corresp.) | Synapse

May 1, 1972

View Full Paper

An efficient algorithm for computing free distance (Corresp.)

LBL.R. BahlIBM (United States)CCC. D. CullumIBM Research - Thomas J. Watson Research Center WFW. FrazerPlanetary Science Institute

Key Points

Key points are not available for this paper at this time.

Abstract

An efficient bidirectional search algorithm for computing the free distance of convolutional codes is described.

Ask AI

Helpful

Bookmark

Share

View Full Paper

Ask AI

Helpful

Bookmark

Share

View Full Paper

Cite This Study

Bahl et al. (Mon,) studied this question.

synapsesocial.com/papers/6a10e9d4841c44b13064927a https://doi.org/https://doi.org/10.1109/tit.1972.1054821

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Fast Sequential Decoding Algorithm Using a Stack1969 · 541 citations
2An Appraisal of Some Shortest-Path Algorithms1969 · 998 citations
3Error bounds for convolutional codes and an asymptotically optimum decoding algorithm1967 · 6,787 citations
4Construction of convolutional codes for sequential decoding1969 · 28 citations
5Scatter storage techniques1983 · 193 citations