Optimal ternary linear codes

From MaRDI portal
Publication:1200308

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)




Related Items (32)

An optimal ternary [69,5,45 code and related codes] ⋮ Classification of Linear Codes by Extending Their ResidualsThe nonexistence of ternary \([105,6,68\) and \([230,6,152]\) codes] ⋮ Self-orthogonal codes from the strongly regular graphs on up to 40 verticesNew bounds for the minimum length of quaternary linear codes of dimension fiveUniqueness 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 codesThe 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 designsNonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9On the minimum length of ternary linear codesNew 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 projectivitiesOn optimal non-projective ternary linear codes\(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arraysOn the minimum length of linear codes over the field of 9 elementsOn 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 codesOptimal ternary linear codesImproved bounds on \(m_r(2,q)q=19,25,27\)Troika: a ternary cryptographic hash functionOn the covering radius of Simplex codesCoprimitive sets and inextendable codesDivisibility of codes meeting the Griesmer boundOn the nonexistence of some quaternary linear codes meeting the Griesmer boundOn the construction of Griesmer codes of dimension 5Entanglement-assisted quantum codes from quaternary codes of dimension fiveOptimal linear codes over \(\mathrm{GF}(4)\)



Cites Work


This page was built for publication: Optimal ternary linear codes