Some new optimal ternary linear codes
From MaRDI portal
The maximum possible minimum Hamming distance of a ternary \([n,k,d;3]\)-code is determined for many values of \(n\) and \(k\). These results are obtained by a descent method for designing good linear codes.
Recommendations
Cited in
(19)- Ternary linear codes and quadrics
- Construction of binary and ternary self-orthogonal linear codes
- Optimal binary linear codes of length \(\leq 30\)
- Some optimal codes from designs
- The nonexistence of ternary \([105,6,68]\) and \([230,6,152]\) codes
- On complete caps in the projective geometries over F₃
- Linear codes from support designs of ternary cyclic codes
- scientific article; zbMATH DE number 3854971 (Why is no real title available?)
- scientific article; zbMATH DE number 5351434 (Why is no real title available?)
- scientific article; zbMATH DE number 4068781 (Why is no real title available?)
- On ternary error correcting line codes
- Five new optimal ternary linear codes
- Some new results for optimal ternary linear codes
- New ternary linear codes
- scientific article; zbMATH DE number 822738 (Why is no real title available?)
- New ternary and quaternary linear block codes
- Some new ternary linear codes
- scientific article; zbMATH DE number 969980 (Why is no real title available?)
- Ternary (1, 2) optimal linear codes
This page was built for publication: Some new optimal ternary linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364206)
