抄録
In this paper, we clarify the relationship between an initial (final) state in a tail-biting error-trellis and the obtained syndromes. We show that a final state is dependent on the first M syndromes as well, where M is the memory length of the parity-check matrix. Next, we calculate the probability of an initial (final) state conditioned by the syndromes. We also apply this method to concrete examples. It is shown that the initial (final) state in a tail-biting error-trellis is well estimated using these conditional probabilities.
