Abstract
We show that, for cyclic convolutional codes, it is possible to compute a sequence of positive integers, called cyclic column distances, which presents a more regular behavior than the classical column distances sequence. We then design an algorithm for the computation of the free distance based on the calculation of this cyclic column distances sequence.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
