The following pages link to (Q4204104):
Displaying 15 items.
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- Decoding complexity of linear block codes (Q1337931) (← links)
- Block transitive codes attaining the Tsfasman-Vladut-Zink bound (Q2182083) (← links)
- Complexity and sliding-block decodability (Q3129478) (← links)
- (Q3577452) (← links)
- A New Linear Programming Approach to Decoding Linear Block Codes (Q3604646) (← links)
- Bounds on the trellis size of linear block codes (Q4034451) (← links)
- Complementary reliability-based decodings of binary linear block codes (Q4371920) (← links)
- Links between complexity theory and constrained block coding (Q4544764) (← links)
- Tables of coverings for decoding by S-sets (Q4637811) (← links)
- On the Optimal Achievable Rates for Linear Computation With Random Homologous Codes (Q5138805) (← links)
- A Bound for the Maximum Weight of a Linear Code (Q5300513) (← links)
- (Q5460925) (← links)
- Generalization of the Ball-Collision Algorithm (Q5855596) (← links)
- On new problems in asymmetric cryptography based on error-resistant coding (Q6173457) (← links)