An updated table of minimum-distance bounds for binary linear codes
From MaRDI portal
Publication:3773824
DOI10.1109/TIT.1987.1057356zbMath0634.94016OpenAlexW2100230274MaRDI QIDQ3773824
Publication date: 1987
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1987.1057356
Related Items (19)
Weight distributions of linear codes and the Gleason-Pierce theorem ⋮ 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 ⋮ An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions ⋮ Note on Draper and Lin's article Capacity considerations for two-level fractional factorial designs ⋮ 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 ⋮ 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 ⋮ A new presentation of Cheng-Sloane's \([32,17,8\)-code] ⋮ Greedy codes ⋮ Capacity considerations for two-level fractional factorial designs ⋮ Bounds on the dimension of codes and subcodes with prescribed contraction index ⋮ 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)\)
This page was built for publication: An updated table of minimum-distance bounds for binary linear codes
