On the minimum length of binary linear codes
From MaRDI portal
Cites work
- A Bound for Error-Correcting Codes
- A conjecture on the minimum length of linear codes over finite fields
- A new class of codes meeting the Griesmer bound
- Construction of new Griesmer codes of dimension 5
- Construction of optimal linear codes by geometric puncturing
- Divisibility of codes meeting the Griesmer bound
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 3700717 (Why is no real title available?)
- scientific article; zbMATH DE number 67082 (Why is no real title available?)
- scientific article; zbMATH DE number 3497775 (Why is no real title available?)
- scientific article; zbMATH DE number 1284205 (Why is no real title available?)
- Lengths of divisible codes with restricted column multiplicities
- On optimal non-projective ternary linear codes
- On the construction of optimal linear codes of dimension four
- On the Lengths of Divisible Codes
- On the minimum length of quaternary linear codes of dimension five
- On the minimum length of ternary linear codes
- On the nonexistence of q-ary linear codes of dimension five
- On the nonexistence of ternary linear codes attaining the Griesmer bound
- Some new results for optimal ternary linear codes
- The correspondence between projective codes and 2-weight codes
- The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
This page was built for publication: On the minimum length of binary linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363335)