Improved bounds for ternary linear codes of dimension 7
From MaRDI portal
Recommendations
Cited in
(17)- Optimal ternary quasi-cyclic codes
- Improved bounds for quaternary linear codes of dimension 6.
- Restriction conditions on \(\mathrm{PL}(7, 2)\) codes \((3 \le \vert\mathcal{G}_i\vert \le 7)\)
- New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)
- Optimal binary linear codes of dimension at most seven
- Improved lower bound on the Shannon capacity of C₇
- [[:Publication:2355591|Syndrome measurement strategies for the \(7,1,3\) code]]
- A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- Some new quasi-twisted ternary linear codes
- Improvements to the bounds on optimal ternary linear codes of dimension 6
- scientific article; zbMATH DE number 822738 (Why is no real title available?)
- A new iterative computer search algorithm for good quasi-twisted codes
- Some new ternary linear codes
- Generating generalized necklaces and new quasi-cyclic codes
- Improved bounds for ternary linear codes of dimension 8 using tabu search
- New results and bounds on codes over GF(19)
- New results and bounds on codes over \(\mathrm{GF}(17)\)
This page was built for publication: Improved bounds for ternary linear codes of dimension 7
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345649)
