Optimal binary codes from trace codes over a non-chain ring
type: Item
instance of: scholarly article
title: Optimal binary codes from trace codes over a non-chain ring
zbMATH Open document ID: 1393.94935
author: Minjia Shi
author: Patrick Solé
author: Yan Liu
published in: Discrete Applied Mathematics
publication date: 2017-01-23T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6676773
zbMATH Keywords: two-weight codes
zbMATH Keywords: Griesmer bound
zbMATH Keywords: trace codes
zbMATH Keywords: secret sharing schemes
MaRDI profile type: Publication
full work available at URL: j.dam.2016.09.050
OpenAlex ID: W2566658350
cites work: Minimal vectors in linear codes
cites work: Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
cites work: The Gewirtz graph: An exercise in the theory of graph spectra
cites work: Ring geometries, two-weight codes, and strongly regular graphs
cites work: Properties of codes with two homogeneous weights
cites work: The Geometry of Two-Weight Codes
cites work: Weights of linear codes and strongly regular normed spaces
cites work: Q4452086
cites work: A Bound for Error-Correcting Codes
cites work: Q4146667
cites work: Linear codes over \({\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}\)
cites work: Secret sharing schemes from three classes of linear codes
DOI: 10.1016/J.DAM.2016.09.050
description: scientific article; zbMATH DE number 6676773