On the minimum length of ternary linear codes
type: Item
instance of: scholarly article
title: On the minimum length of ternary linear codes
zbMATH Open document ID: 1301.94140
author: Tatsuya Maruta
author: Yusuke Oya
published in: Designs, Codes and Cryptography
publication date: 2013-05-30T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 51E20
Mathematics Subject Classification ID: 94B27
zbMATH DE Number: 6168442
zbMATH Keywords: ternary linear codes
zbMATH Keywords: optimal codes
zbMATH Keywords: projective geometry
MaRDI profile type: Publication
full work available at URL: s10623-011-9593-y
OpenAlex ID: W1983816381
cites work: Some new results for optimal ternary linear codes
cites work: The correspondence between projective codes and 2-weight codes
cites work: A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
cites work: Q4521901
cites work: Caps and codes
cites work: Q4011770
cites work: An extension theorem for linear codes
cites work: Optimal ternary linear codes
cites work: Fundamentals of Error-Correcting Codes
cites work: Ternary linear codes and quadrics
cites work: On the nonexistence of quaternary \([51, 4, 37]\) codes
cites work: The nonexistence of some optimal ternary codes of dimension five
cites work: On the nonexistence of \(q\)-ary linear codes of dimension five
cites work: Extendability of ternary linear codes
cites work: Extension theorems for linear codes over finite fields
cites work: On optimal ternary linear codes of dimension 6
cites work: Q3099884
cites work: On optimal non-projective ternary linear codes
cites work: An optimal ternary [69,5,45] code and related codes
cites work: Classification of some optimal ternary linear codes of small length
cites work: Divisibility of codes meeting the Griesmer bound
DOI: 10.1007/S10623-011-9593-Y
description: scientific article; zbMATH DE number 6168442