Pages that link to "Item:Q3893816"
From MaRDI portal
The following pages link to Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity (Q3893816):
Displaying 8 items.
- On multi-trial Forney-Kovalev decoding of concatenated codes (Q2437957) (← links)
- Iterated logarithmic expansions of the pathwise code lengths for exponential families (Q2706003) (← links)
- A note on performance of generalized tail biting trellis codes (Q3005858) (← links)
- Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes (Q3410907) (← links)
- (Q4204111) (← links)
- Generalized concatenated codes for channels where unidirectional byte errors are predominant (Q4277159) (← links)
- Constructions of generalized concatenated codes and their trellis-based decoding complexity (Q4701323) (← links)
- Bounds on the weight hierarchy of generalized concatenated codes (Q4896857) (← links)