Abstract
We give a generalization of the shift bound on the minimum distance for cyclic codes which applies to Reed—Muller and algebraic-geometric codes. The number of errors one can correct by majority coset decoding is up to hdlf the shift bound.
| Original language | English |
|---|---|
| Title of host publication | Arithmetic, Geometry and Coding Theory |
| Editors | G.R. Pellikaan, M. Perret, S.G. Vladut |
| Place of Publication | Berlijn |
| Publisher | Walter de Gruyter GmbH |
| Pages | 155-174 |
| ISBN (Print) | 3-11-014616-9 |
| Publication status | Published - 1996 |
| Event | conference; AGCT-4, Luminy, June 28-July 2, 1993 - Duration: 1 Jan 1996 → … |
Conference
| Conference | conference; AGCT-4, Luminy, June 28-July 2, 1993 |
|---|---|
| Period | 1/01/96 → … |
| Other | AGCT-4, Luminy, June 28-July 2, 1993 |