Pages that link to "Item:Q3773824"
From MaRDI portal
The following pages link to An updated table of minimum-distance bounds for binary linear codes (Q3773824):
Displaying 18 items.
- A new presentation of Cheng-Sloane's \([32,17,8]\)-code (Q689752) (← links)
- Greedy codes (Q690025) (← links)
- Bounds on the dimension of codes and subcodes with prescribed contraction index (Q749512) (← links)
- Binary set functions and parity check matrices (Q914651) (← links)
- A [45,13] code with minimal distance 16 (Q917526) (← links)
- Some optimal codes from algebraic geometry and their covering radii (Q918506) (← links)
- Local randomness in pseudorandom sequences (Q1180515) (← links)
- Searching with lies: The Ulam problem (Q1199612) (← links)
- The \([18,9,6]\) code is unique (Q1199635) (← links)
- Optimal ternary quasi-cyclic codes (Q1200304) (← links)
- Optimal ternary linear codes (Q1200308) (← links)
- Capacity considerations for two-level fractional factorial designs (Q1262057) (← links)
- On designs and formally self-dual codes (Q1321556) (← links)
- On the \([28,7,12]\) binary self-complementary codes and their residuals (Q1321558) (← links)
- Optimal linear codes over \(\mathrm{GF}(4)\) (Q1322271) (← links)
- Weight distributions of linear codes and the Gleason-Pierce theorem (Q1331144) (← links)
- Note on Draper and Lin's article ''Capacity considerations for two-level fractional factorial designs'' (Q1361743) (← links)
- An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions (Q1895965) (← links)
