Some optimal codes from algebraic geometry and their covering radii
From MaRDI portal
Publication:918506
DOI10.1016/S0195-6698(13)80125-4zbMath0705.94014MaRDI QIDQ918506
Publication date: 1990
Published in: European Journal of Combinatorics (Search for Journal in Brave)
upper bounds; Griesmer bound; lower bound; Goppa codes; algebraic geometry; minimum distance; Griesmer codes; covering and packing codes; covering radius of algebraic geometric codes; max-hyper; min-hyper; saturation configurations; t-independent sets
Related Items
On the covering radius of Simplex codes, A note on the covering radius of optimum codes, On the covering radius of Reed-Solomon codes, On saturating sets in projective spaces., On saturating sets in small projective geometries, A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of optimal linear codes using flats and spreads in a finite projective geometry
- Minimum block length of a linear q-ary code with specified dimension and code distance
- Factoring integers with elliptic curves
- Nonsingular plane cubic curves over finite fields
- Saturated configurations of points in projective Galois spaces
- On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
- Spectra of algebro-geometric codes
- Self-dual Goppa codes
- Simple constructions for elliptic cubic curves with specified small numbers of points
- 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
- Generalized Reed - Solomon codes from algebraic geometry
- Codes and information
- On the covering radius of binary, linear codes meeting the Griesmer bound
- Covering radius---Survey and recent results
- Weierstrass Points and Curves Over Finite Fields
- Further results on the covering radius of codes
- An updated table of minimum-distance bounds for binary linear codes
- Some new upper bounds on the covering radius of binary linear codes
- Short codes with a given covering radius
- Covering Radius Computations for Binary Cyclic Codes
