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.
| Original language | English |
|---|---|
| Pages | 349 |
| Number of pages | 1 |
| Publication status | Published - 1 Jan 1995 |
| Externally published | Yes |
| Event | Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: 17 Sept 1995 → 22 Sept 1995 |
Conference
| Conference | Proceedings of the 1995 IEEE International Symposium on Information Theory |
|---|---|
| City | Whistler, BC, Can |
| Period | 17/09/95 → 22/09/95 |