A new lower bound on the minimal length of a binary linear code
From MaRDI portal
\textit{S. M. Dodunekov} and \textit{N. L. Manev} have given lower bounds for \(n(k,d)\), the smallest integer for which there exists a binary \([n, k, d]\)-code [see Discrete Appl. Math. 12, 103-114 (1985; Zbl 0603.94011)]. For many values, these bounds are improved. The question of existence of certain codes is examined to prepare a table of bounds on \(n(9, d)\) for \(d\leq 2^8\).
Recommendations
- New bounds for the minimum length of binary linear block codes
- Some bounds for the minimum length of binary linear codes of dimension nine
- New bounds on binary linear codes of dimension eight (Corresp.)
- Some new results on the minimum length of binary linear codes of dimension nine
- Bounds for binary codes of length less than 25
Cited in
(12)- Minimum block length of a linear q-ary code with specified dimension and code distance
- New bounds for the minimum length of binary linear block codes
- Optimal binary linear codes of length \(\leq 30\)
- Some results on the existence of binary linear codes (Corresp.)
- scientific article; zbMATH DE number 5524392 (Why is no real title available?)
- Bounds for binary codes of length less than 25
- scientific article; zbMATH DE number 702178 (Why is no real title available?)
- Some new results on the minimum length of binary linear codes of dimension nine
- Some bounds for the minimum length of binary linear codes of dimension nine
- New lower bounds on aperiodic crosscorrelation of binary codes
- One more proof of the first linear programming bound for binary codes and two conjectures
- Minimum possible block length of a linear binary code for some distances
This page was built for publication: A new lower bound on the minimal length of a binary linear code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916055)
