Optimal ternary linear codes

DOI10.1007/BF00124893zbMath0756.94008MaRDI QIDQ1200308

D. E. Newton, Raymond Hill

Publication date: 16 January 1993

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

optimal ternary linear codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (32)

An optimal ternary [69,5,45 code and related codes] ⋮ Classification of Linear Codes by Extending Their Residuals ⋮ The nonexistence of ternary \([105,6,68\) and \([230,6,152]\) codes] ⋮ Self-orthogonal codes from the strongly regular graphs on up to 40 vertices ⋮ New bounds for the minimum length of quaternary linear codes of dimension five ⋮ Uniqueness of \([87,5,57; 3\)-codes and the nonexistence of \([258,6,171; 3]\)-codes] ⋮ 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\)] ⋮ A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codes ⋮ The nonexistence of \([71,5,46;3\)-codes] ⋮ On the non-existence of a projective (75, 4, 12, 5) set in PG(3, 7) ⋮ On the minimum length of linear codes over \(\mathbb{F}_5\) ⋮ Linearly embeddable designs ⋮ Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9 ⋮ On the minimum length of ternary linear codes ⋮ New minimum distance bounds for linear codes over GF(5). ⋮ On complete caps in the projective geometries over \(\mathbb F_3\) ⋮ Constructing linear codes from some orbits of projectivities ⋮ On optimal non-projective ternary linear codes ⋮ \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays ⋮ On the minimum length of linear codes over the field of 9 elements ⋮ On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q\)-codes meeting the Griesmer bound] ⋮ Optimal ternary quasi-cyclic codes ⋮ Optimal ternary linear codes ⋮ Improved bounds on \(m_r(2,q)q=19,25,27\) ⋮ Troika: a ternary cryptographic hash function ⋮ On the covering radius of Simplex codes ⋮ Coprimitive sets and inextendable codes ⋮ Divisibility of codes meeting the Griesmer bound ⋮ On the nonexistence of some quaternary linear codes meeting the Griesmer bound ⋮ On the construction of Griesmer codes of dimension 5 ⋮ Entanglement-assisted quantum codes from quaternary codes of dimension five ⋮ Optimal linear codes over \(\mathrm{GF}(4)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum block length of a linear q-ary code with specified dimension and code distance
• The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
• Optimal ternary quasi-cyclic codes
• Optimal ternary linear codes
• Caps and codes
• A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry
• The packing problem for projective geometries over GF(3) with dimension greater than five
• There is no binary (25,8,10) code
• An updated table of minimum-distance bounds for binary linear codes
• New bounds on binary linear codes of dimension eight (Corresp.)
• Algebraically punctured cyclic codes
• A Bound for Error-Correcting Codes
• Minimum-distance bounds for binary linear codes

This page was built for publication: Optimal ternary linear codes