Pages that link to "Item:Q4277170"
From MaRDI portal
The following pages link to On complexity of trellis structure of linear block codes (Q4277170):
Displaying 15 items.
- Higher Hamming weights for locally recoverable codes on algebraic curves (Q285459) (← links)
- The effective length of subcodes (Q1335138) (← links)
- On the comparative complexity of algorithms for constructing the syndrome trellis of a linear block code (Q1582940) (← links)
- Goppa-like bounds for the generalized Feng-Rao distances. (Q1811099) (← links)
- Bounds on complexity of trellis decoding of linear block codes (Q1895472) (← links)
- On trellis structures for Reed-Muller codes (Q1971064) (← links)
- Trellis complexity versus the coding gain of lattices. II (Q3129467) (← links)
- The trellis complexity of convolutional codes (Q3129472) (← links)
- (Q3328459) (← links)
- Bounds on the trellis size of linear block codes (Q4034451) (← links)
- (Q4242031) (← links)
- Trellis complexity of linear block codes via atomic codewords (Q4375829) (← links)
- (Q4399936) (← links)
- On the BCJR trellis for linear block codes (Q4885710) (← links)
- Weight distributions and weight hierarchies of a class of binary linear codes with a few weights (Q6646798) (← links)