Pages that link to "Item:Q3689097"
From MaRDI portal
The following pages link to On the complete decoding of binary linear codes (Corresp.) (Q3689097):
Displaying 12 items.
- Enumerating and decoding perfect linear Lee codes (Q735017) (← links)
- Edge local complementation and equivalence of binary linear codes (Q1009082) (← links)
- A note on the computation of the bit error rate for binary block codes (Q1101413) (← links)
- On the characterization of linear uniquely decodable codes (Q1963167) (← links)
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding (Q2894429) (← links)
- (Q3797100) (← links)
- On two probabilistic decoding algorithms for binary linear codes (Q3987473) (← links)
- On the complete decoding of constrained codes (Q4034457) (← links)
- Complementary reliability-based decodings of binary linear block codes (Q4371920) (← links)
- (Q4500987) (← links)
- On the universality of the LZ-based decoding algorithm (Q4701154) (← links)
- (Q5507035) (← links)