Newton's identities for minimum codewords of a family of alternant codes

Daniel Augot

Newton's identities for minimum codewords of a family of alternant codes

Daniel Augot

INTRIA

Résultats de recherche: Contribution à une conférence › Papier › Revue par des pairs

Résumé

We are able to define minimum weight codewords of some alternant codes in terms of solutions to algebraic equations. Particular attention is given to the case of the classical Goppa codes. Grobner bases are used to solve the system of algebraic equations.

langue originale	Anglais
Pages	349
Nombre de pages	1
état	Publié - 1 janv. 1995
Modification externe	Oui
Evénement	Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Durée: 17 sept. 1995 → 22 sept. 1995

Une conférence

Une conférence	Proceedings of the 1995 IEEE International Symposium on Information Theory
La ville	Whistler, BC, Can
période	17/09/95 → 22/09/95

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

@conference{c870ab92d58a48ce95edfc6ea471f4b1,

title = "Newton's identities for minimum codewords of a family of alternant codes",

abstract = "We are able to define minimum weight codewords of some alternant codes in terms of solutions to algebraic equations. Particular attention is given to the case of the classical Goppa codes. Grobner bases are used to solve the system of algebraic equations.",

author = "Daniel Augot",

year = "1995",

month = jan,

day = "1",

language = "English",

pages = "349",

note = "Proceedings of the 1995 IEEE International Symposium on Information Theory ; Conference date: 17-09-1995 Through 22-09-1995",

}

TY - CONF

T1 - Newton's identities for minimum codewords of a family of alternant codes

AU - Augot, Daniel

PY - 1995/1/1

Y1 - 1995/1/1

N2 - We are able to define minimum weight codewords of some alternant codes in terms of solutions to algebraic equations. Particular attention is given to the case of the classical Goppa codes. Grobner bases are used to solve the system of algebraic equations.

AB - We are able to define minimum weight codewords of some alternant codes in terms of solutions to algebraic equations. Particular attention is given to the case of the classical Goppa codes. Grobner bases are used to solve the system of algebraic equations.

UR - https://www.scopus.com/pages/publications/0029203716

M3 - Paper

AN - SCOPUS:0029203716

SP - 349

T2 - Proceedings of the 1995 IEEE International Symposium on Information Theory

Y2 - 17 September 1995 through 22 September 1995

ER -

Newton's identities for minimum codewords of a family of alternant codes

Résumé

Une conférence

Autres fichiers et liens

Empreinte digitale

Contient cette citation