Pages that link to "Item:Q5630986"
From MaRDI portal
The following pages link to The complexity of decoders--II: Computational work and decoding time (Q5630986):
Displaying 5 items.
- A survey of constructive coding theory, and a table of binary codes of highest known rate (Q2555036) (← 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)
- Fast message authentication using efficient polynomial evaluation (Q4639340) (← links)
- The complexity of error-correcting codes (Q5055921) (← links)