Pages that link to "Item:Q3129472"
From MaRDI portal
The following pages link to The trellis complexity of convolutional codes (Q3129472):
Displaying 12 items.
- Generalized punctured convolutional codes with unequal error protection (Q1015945) (← links)
- On the trellis complexity of block and convolutional codes (Q1389282) (← links)
- On the comparative complexity of algorithms for constructing the syndrome trellis of a linear block code (Q1582940) (← links)
- On maximum length convolutional codes under a trellis complexity constraint (Q1827577) (← links)
- A comparison of trellis modules for binary convolutional codes (Q2714805) (← links)
- Error-trellises for convolutional codes. I: Construction (Q2714817) (← links)
- Variable-complexity trellis decoding of binary convolutional codes (Q2726191) (← links)
- Trellis complexity versus the coding gain of lattices. II (Q3129467) (← links)
- A goppa-like bound on the trellis state complexity of algebraic-geometric codes (Q4679952) (← links)
- On the trellis representation of the Delsarte-Goethals codes (Q4701125) (← links)
- Constructions of generalized concatenated codes and their trellis-based decoding complexity (Q4701323) (← links)
- Asymptotically good codes have infinite trellis complexity (Q4838693) (← links)