The following pages link to Optimal ternary linear codes (Q1200308):
Displayed 20 items.
- On the non-existence of a projective (75, 4, 12, 5) set in PG(3, 7) (Q601735) (← links)
- Coprimitive sets and inextendable codes (Q1008999) (← links)
- On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound (Q1200291) (← links)
- Optimal ternary quasi-cyclic codes (Q1200304) (← links)
- Optimal ternary linear codes (Q1200308) (← links)
- Divisibility of codes meeting the Griesmer bound (Q1268604) (← links)
- On the nonexistence of some quaternary linear codes meeting the Griesmer bound (Q1299055) (← links)
- Optimal linear codes over \(\mathrm{GF}(4)\) (Q1322271) (← links)
- An optimal ternary [69,5,45] code and related codes (Q1329117) (← links)
- New bounds for the minimum length of quaternary linear codes of dimension five (Q1357737) (← links)
- Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes (Q1361705) (← links)
- A characterization of some \(\{ 3v_ 2+v_ 3,3v_ 1+v_ 2; 3,3\}\)-minihypers and some \([15,4,9; 3]\)-codes with \(B_ 2=0\) (Q1361706) (← links)
- A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codes (Q1361708) (← links)
- New minimum distance bounds for linear codes over GF(5). (Q1420589) (← links)
- The nonexistence of ternary \([105,6,68]\) and \([230,6,152]\) codes (Q1887641) (← links)
- The nonexistence of \([71,5,46;3]\)-codes (Q1918454) (← links)
- On complete caps in the projective geometries over \(\mathbb F_3\) (Q1976895) (← links)
- Constructing linear codes from some orbits of projectivities (Q2470452) (← links)
- On optimal non-projective ternary linear codes (Q2470453) (← links)
- On the covering radius of Simplex codes (Q4440676) (← links)