Polynomial-time construction of codes. I: Linear codes with almost equal weights
type: Item
instance of: scholarly article
title: Polynomial-time construction of codes. I: Linear codes with almost equal weights
zbMATH Open document ID: 0757.94014
DOI: 10.1007/BF01387197
author: Gilles Lachaud
author: Jacques Stern
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 97623
zbMATH Keywords: linear codes
zbMATH Keywords: asymptotic bounds
zbMATH Keywords: Reed-Müller codes
zbMATH Keywords: polynomial complexity
zbMATH Keywords: weights
zbMATH Keywords: disparity
zbMATH Keywords: concatenation
MaRDI profile type: Publication
cites work: ALGEBRAICO-GEOMETRIC CODES
cites work: Q3994524
cites work: Modular curves and codes with polynomial complexity of construction
cites work: Modular curves and codes with a polynomial construction
cites work: The parameters of projective Reed-Müller codes
cites work: Q4146667
cites work: Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
cites work: Q4858431
cites work: Q4038757
cites work: Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres
description: scientific article; zbMATH DE number 97623