article · 2015
An Upper Bound on Decoding Bit-Error Probability with Linear Coding on Extremely Noisy Channels1
Marc H, Rolf Johannesson, James L. Massey, Per Stiihl
Cited by 0Abstract and details only
Abstract
Abstract- When concatenated coding schemes op-erate near channel capacity their component encoders may operate above capacity. The decoding bit-error performance of binary convolutional codes near and above capacity is investigated. Let G ( D) be a b x c generator matrix of a rate R = b /c con-volutional code. We define a tap-minimal right pseudo inverse of the generator matrix G(D) to be a right pseudo inverse of G ( D) with the minimum number of taps among all right pseudo inverses. By the number of “taps ” in a right pseudo inverse we mean the total number of nonzero coefficients in the power series that are entries of this c x b matrix. We now define the pseudo-inverse decoder (T-decoder) for convolutional codes. Assume that we use a convolutional code C encoded by the generator matrix G(D) for transmission over
Cite this paper
H, M., Johannesson, R., Massey, J. L., & Stiihl, P. (2015). An Upper Bound on Decoding Bit-Error Probability with Linear Coding on Extremely Noisy Channels1.
H, Marc, et al. “An Upper Bound on Decoding Bit-Error Probability with Linear Coding on Extremely Noisy Channels1.” 2015.
H, Marc, Rolf Johannesson, James L. Massey, and Per Stiihl. 2015. “An Upper Bound on Decoding Bit-Error Probability with Linear Coding on Extremely Noisy Channels1.”
H, M. et al. (2015) ‘An Upper Bound on Decoding Bit-Error Probability with Linear Coding on Extremely Noisy Channels1’.
@article{h2015upper,
title = {{An Upper Bound on Decoding Bit-Error Probability with Linear Coding on Extremely Noisy Channels1}},
author = {H, Marc and Johannesson, Rolf and Massey, James L. and Stiihl, Per},
year = {2015}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.