Abstract
An improved bidirectional search algorithm for computing the weight spectrum of convolutional codes is presented. This algorithm does not employ the column distance function of a code which plays an important role in the original bidirectional search algorithm. We show the proposed algorithm can reduce computaion time for obtaining the weigth spectrum of convolutional codes significantly compared with that of the bidirectional search algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Paper Title
Journal
Date
