An updated table of minimum-distance bounds for binary linear codes
From MaRDI portal
Recommendations
Cited in
(22)- Local randomness in pseudorandom sequences
- Searching with lies: The Ulam problem
- The \([18,9,6]\) code is unique
- Optimal ternary quasi-cyclic codes
- Optimal ternary linear codes
- Capacity considerations for two-level fractional factorial designs
- On designs and formally self-dual codes
- On the \([28,7,12]\) binary self-complementary codes and their residuals
- Optimal linear codes over \(\mathrm{GF}(4)\)
- Weight distributions of linear codes and the Gleason-Pierce theorem
- Note on Draper and Lin's article Capacity considerations for two-level fractional factorial designs
- An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions
- scientific article; zbMATH DE number 3878836 (Why is no real title available?)
- The generation of rimitive olynomials in GF(q) with independent roots and their applications for ower residue codes, VLSI testing and finite field multipliers using normal basis
- Binary codes with improved minimum weights (Corresp.)
- scientific article; zbMATH DE number 702178 (Why is no real title available?)
- A new presentation of Cheng-Sloane's \([32,17,8]\)-code
- Greedy codes
- Bounds on the dimension of codes and subcodes with prescribed contraction index
- Binary set functions and parity check matrices
- A [45,13] code with minimal distance 16
- Some optimal codes from algebraic geometry and their covering radii
This page was built for publication: An updated table of minimum-distance bounds for binary linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773824)
