Pages that link to "Item:Q1005242"
From MaRDI portal
The following pages link to A method for efficiently computing the number of codewords of fixed weights in linear codes (Q1005242):
Displaying 6 items.
- A method for efficiently computing the number of codewords of fixed weights in linear codes (Q1005242) (← links)
- Random generation of linear codes. (Q1306343) (← links)
- Characteristic vector and weight distribution of a linear code (Q2040349) (← links)
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation (Q2350921) (← links)
- Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств (Q3381861) (← links)
- Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures (Q6600001) (← links)