Skip to Main content Skip to Navigation
Conference papers

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

Daniel Augot 1
1 CODES - Coding and cryptography
Inria Paris-Rocquencourt
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
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/inria-00509424
Contributor : Daniel Augot <>
Submitted on : Thursday, August 12, 2010 - 11:42:24 AM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on: : Saturday, November 13, 2010 - 2:35:59 AM

Files

alternant-algsys.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Daniel Augot. Newton's identities for minimum codewords of a family of alternant codes. 1995 IEEE International Symposium on Information Theory, Sep 1995, Whistler, Canada. pp.349, ⟨10.1109/ISIT.1995.550336⟩. ⟨inria-00509424⟩

Share

Metrics

Record views

241

Files downloads

250