Pages that link to "Item:Q4202097"
From MaRDI portal
The following pages link to The linear programming bound for binary linear codes (Q4202097):
Displaying 23 items.
- New upper bounds for the size of permutation codes via linear programming (Q612914) (← links)
- On linear codes which attain the Solomon-Stiffler bound (Q798293) (← links)
- Nonexistence of near-extremal formally self-dual even codes of length divisible by 8 (Q881582) (← links)
- A note on formally self-dual even codes of length divisible by 8 (Q946872) (← links)
- A search algorithm for linear codes: Progressive dimension growth (Q1009177) (← links)
- Linear codes and character sums (Q1410404) (← links)
- Antichain codes (Q1591641) (← links)
- A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters (Q1802186) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Linear programming bounds for distributed storage codes (Q2176298) (← links)
- The linear programming bound for codes over finite Frobenius rings (Q2384000) (← links)
- (Q3364203) (← links)
- Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography (Q3548016) (← links)
- Fundamentals of coding type problems (Q3637813) (← links)
- (Q4204104) (← links)
- (Q4379736) (← links)
- (Q4827523) (← links)
- Linear Programming Approximations for Index Coding (Q5211387) (← links)
- A Bound for the Maximum Weight of a Linear Code (Q5300513) (← links)
- (Q5460925) (← links)
- (Q5708623) (← links)
- The degree of functions and weights in linear codes. (Q5939238) (← links)
- One more proof of the first linear programming bound for binary codes and two conjectures (Q6050274) (← links)
