3 citations · 3 across the 5 of their papers we have counts for
5 papers
Reduction of Error-Trellises for Tail-Biting Convolutional Codes Using Shifted Error-Subsequences
Masato Tajima, Koji Okino, Tatsuto Murayama
In this paper, we discuss the reduction of error-trellises for tail-biting convolutional codes. In the case where some column of a parity-check matrix has a monomial factor (with i…
Error-Trellis Construction for Tailbiting Convolutional Codes
Masato Tajima, Koji Okino
In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former st…
Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences
Masato Tajima, Koji Okino, Takashi Miyagoshi
In this paper, we show that the code-trellis and the error-trellis for a convolutional code can be reduced simultaneously, if reduction is possible. Assume that the error-trellis c…
1-State Error-Trellis Decoding of LDPC Convolutional Codes Based on Circulant Matrices
Masato Tajima, Koji Okino, Takashi Miyagoshi
We consider the decoding of convolutional codes using an error trellis constructed based on a submatrix of a given check matrix. In the proposed method, the syndrome-subsequence co…
Error-Trellis State Complexity of LDPC Convolutional Codes Based on Circulant Matrices
M. Tajima, K. Okino, T. Miyagoshi
Let H(D) be the parity-check matrix of an LDPC convolutional code corresponding to the parity-check matrix H of a QC code obtained using the method of Tanner et al. We see that the…