TY - GEN
T1 - Error Exponents of Typical Random Trellis Codes
AU - Merhav, Neri
N1 - Publisher Copyright: © 2019 IEEE.
PY - 2019/8
Y1 - 2019/8
N2 - In continuation to an earlier work, where error exponents of typical random codes were studied in the context of general block coding, with no underlying structure, here we carry out a parallel study on typical random, time-varying trellis codes, focusing on a certain range of low rates. By analyzing an upper bound to the error probability of the typical random trellis code, using the method of types, we first derive a Csiszár-style error exponent formula (with respect to the constraint length), which allows to characterize properties of good codes and dominant error events. We also derive a Gallager-style form, which turns out to be related to the expurgated error exponent. The main result is further extended to channels with memory and mismatch.
AB - In continuation to an earlier work, where error exponents of typical random codes were studied in the context of general block coding, with no underlying structure, here we carry out a parallel study on typical random, time-varying trellis codes, focusing on a certain range of low rates. By analyzing an upper bound to the error probability of the typical random trellis code, using the method of types, we first derive a Csiszár-style error exponent formula (with respect to the constraint length), which allows to characterize properties of good codes and dominant error events. We also derive a Gallager-style form, which turns out to be related to the expurgated error exponent. The main result is further extended to channels with memory and mismatch.
UR - http://www.scopus.com/inward/record.url?scp=85081103546&partnerID=8YFLogxK
U2 - 10.1109/ITW44776.2019.8988947
DO - 10.1109/ITW44776.2019.8988947
M3 - منشور من مؤتمر
T3 - 2019 IEEE Information Theory Workshop, ITW 2019
BT - 2019 IEEE Information Theory Workshop, ITW 2019
T2 - 2019 IEEE Information Theory Workshop, ITW 2019
Y2 - 25 August 2019 through 28 August 2019
ER -