The shift bound for cyclic, Reed-Muller and geometric Goppa codes

G.R. Pellikaan

The shift bound for cyclic, Reed-Muller and geometric Goppa codes

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Hoofdstuk › Academic › peer review

Samenvatting

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.

Originele taal-2	Engels
Titel	Arithmetic, Geometry and Coding Theory
Redacteuren	G.R. Pellikaan, M. Perret, S.G. Vladut
Plaats van productie	Berlijn
Uitgeverij	Walter de Gruyter GmbH
Pagina's	155-174
ISBN van geprinte versie	3-11-014616-9
Status	Gepubliceerd - 1996
Evenement	conference; AGCT-4, Luminy, June 28-July 2, 1993 - Duur: 1 jan. 1996 → …

Congres

Congres	conference; AGCT-4, Luminy, June 28-July 2, 1993
Periode	1/01/96 → …
Ander	AGCT-4, Luminy, June 28-July 2, 1993

Citeer dit

@inbook{839fd0a0f80f417f95e0ac29812ba66c,

title = "The shift bound for cyclic, Reed-Muller and geometric Goppa codes",

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.",

author = "G.R. Pellikaan",

year = "1996",

language = "English",

isbn = "3-11-014616-9",

pages = "155--174",

editor = "G.R. Pellikaan and M. Perret and S.G. Vladut",

booktitle = "Arithmetic, Geometry and Coding Theory",

publisher = "Walter de Gruyter GmbH",

address = "Germany",

note = "conference; AGCT-4, Luminy, June 28-July 2, 1993 ; Conference date: 01-01-1996",

}

TY - CHAP

T1 - The shift bound for cyclic, Reed-Muller and geometric Goppa codes

AU - Pellikaan, G.R.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

M3 - Chapter

SN - 3-11-014616-9

SP - 155

EP - 174

BT - Arithmetic, Geometry and Coding Theory

A2 - Pellikaan, G.R.

A2 - Perret, M.

A2 - Vladut, S.G.

PB - Walter de Gruyter GmbH

CY - Berlijn

T2 - conference; AGCT-4, Luminy, June 28-July 2, 1993

Y2 - 1 January 1996

ER -

The shift bound for cyclic, Reed-Muller and geometric Goppa codes

Samenvatting

Congres

Vingerafdruk

Citeer dit