A fast algorithm for computing distance spectrum of convolutional codes

DOI10.1109/18.45271MaRDI QIDQ3470415zbMATH OpenOpenAlexFDO

Authors Mats Cedervall, Rolf Johannesson

Publication date 1989

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://lup.lub.lu.se/record/1056902

zbMATH Keywords

distance spectrum of convolutional codesfast algorithm for searching a tree

Mathematics Subject Classification ID

Convolutional codes (94B10)

Recommendations

• An algorithm for computing the distance spectrum of trellis codes
• Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al.
• A construction technique for random-error-correcting convolutional codes
• A BEAST for Prowling in Trees
• New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile

Cited in

(4)

• Fast algorithm for sequential machine to compute pattern spectrum via city-block distance transform
• Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes
• Search algorithm for increase the performance of codes generated by finite automatons
• A BEAST for Prowling in Trees

This page was built for publication: A fast algorithm for computing distance spectrum of convolutional codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470415)