Some optimal codes from algebraic geometry and their covering radii
type: Item
instance of: scholarly article
title: Some optimal codes from algebraic geometry and their covering radii
zbMATH Open document ID: 0705.94014
DOI: 10.1016/S0195-6698(13)80125-4
author: Heeralal Janwa
published in: European Journal of Combinatorics
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 14Q99
zbMATH DE Number: 4158553
zbMATH Keywords: Goppa codes
zbMATH Keywords: algebraic geometry
zbMATH Keywords: Griesmer bound
zbMATH Keywords: Griesmer codes
zbMATH Keywords: minimum distance
zbMATH Keywords: lower bound
zbMATH Keywords: covering radius of algebraic geometric codes
zbMATH Keywords: upper bounds
zbMATH Keywords: saturation configurations
zbMATH Keywords: t-independent sets
zbMATH Keywords: min-hyper
zbMATH Keywords: max-hyper
zbMATH Keywords: covering and packing codes
MaRDI profile type: Publication
cites work: Q3487282
cites work: Short codes with a given covering radius
cites work: On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
cites work: On the covering radius of binary, linear codes meeting the Griesmer bound
cites work: Q5810622
cites work: Covering radius---Survey and recent results
cites work: Further results on the covering radius of codes
cites work: Minimum block length of a linear q-ary code with specified dimension and code distance
cites work: Covering Radius Computations for Binary Cyclic Codes
cites work: Codes and information
cites work: Characterization of \(\{2(q+1)+2,2;t,q\}\)-\(\min \cdot hypers\) in PG(t,q) (t\(\geq 3,q\geq 5)\) and its applications to error-correcting codes
cites work: Q3813825
cites work: Construction of optimal linear codes using flats and spreads in a finite projective geometry
cites work: Q4143433
cites work: Q4726166
cites work: Q3801474
cites work: Q3851217
cites work: Q3218060
cites work: Q3694152
cites work: Q4748267
cites work: Some new upper bounds on the covering radius of binary linear codes
cites work: Spectra of algebro-geometric codes
cites work: Simple constructions for elliptic cubic curves with specified small numbers of points
cites work: Q3741567
cites work: Q3795778
cites work: Factoring integers with elliptic curves
cites work: Q3831025
cites work: Q3794074
cites work: Generalized Reed - Solomon codes from algebraic geometry
cites work: Q4146667
cites work: Nonsingular plane cubic curves over finite fields
cites work: Q3324076
cites work: Self-dual Goppa codes
cites work: Weierstrass Points and Curves Over Finite Fields
cites work: Saturated configurations of points in projective Galois spaces
cites work: An updated table of minimum-distance bounds for binary linear codes
full work available at URL: s0195-6698(13)80125-4
OpenAlex ID: W1980690205
Recommended article: A note on the covering radius of optimum codes
Recommended article: On the covering radius of codes
Recommended article: The Generalized Covering Radii of Linear Codes
Recommended article: Q3999645
Recommended article: Some geometric-algebraic codes on a covering plane curve
Recommended article: The multicovering radii of codes
Recommended article: On the covering radius of Simplex codes
Recommended article: A new approach to the covering radius of codes
Recommended article: Some results on the covering radii of Reed-Muller codes
Recommended article: Further results on the covering radius of codes
description: scientific article; zbMATH DE number 4158553