Pages that link to "Item:Q4149649"
From MaRDI portal
The following pages link to Efficient maximum likelihood decoding of linear block codes using a trellis (Q4149649):
Displaying 15 items.
- Code constructions and existence bounds for relative generalized Hamming weight (Q369440) (← links)
- New approaches to reduced-complexity decoding (Q1180151) (← links)
- The weight hierarchies and generalized weight spectra of the projective codes from degenerate quadrics (Q1377878) (← links)
- On viewing block codes as finite automata. (Q1401192) (← links)
- On self-dual ternary codes and their coordinate ordering. (Q1582648) (← links)
- On trellis structures for Reed-Muller codes (Q1971064) (← links)
- On the relative profiles of a linear code and a subcode (Q2248638) (← links)
- MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams (Q2732978) (← links)
- A note on characteristic generators of a free cyclic code and its dual (Q3054691) (← links)
- (Q3328459) (← links)
- A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm (Q3786396) (← links)
- An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder (Q4308768) (← links)
- (Q4399936) (← links)
- Sequential decoding for a subcode of Reed Solomon Codes (Q4608493) (← links)
- Soft decoding of short/medium length codes using ordered statistics for quantum key distribution (Q5037878) (← links)