Some new optimal ternary linear codes
type: Item
instance of: scholarly article
title: Some new optimal ternary linear codes
zbMATH Open document ID: 0903.94046
DOI: 10.1023/A:1008215724132
author: Iliya G. Boukliev
published in: Designs, Codes and Cryptography
publication date: 1997-08-25T00:00:00Z
review text: The maximum possible minimum Hamming distance of a ternary \([n,k,d;3]\)-code is determined for many values of \(n\) and \(k\). These results are obtained by a descent method for designing good linear codes.
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 1051426
zbMATH Keywords: optimal ternary linear codes
zbMATH Keywords: Hamming distance
reviewed by: Ralph-Hardo Schulz
MaRDI profile type: Publication
full work available at URL: a:1008215724132
OpenAlex ID: W1570800770
description: scientific article; zbMATH DE number 1051426