Grõbner bases and minimum distance of affine varieties codes
We present a method to estimate the minimum distance of affine varieties codes. Our technique uses properties of the footprint of an ideal obtained by enlarging the defining ideal of the variety, and may be applied also to codes which do not come from the so-called weight domains.
Saved in:
Main Author: | |
---|---|
Format: | Digital revista |
Language: | English |
Published: |
Sociedade Brasileira de Matemática Aplicada e Computacional
2012
|
Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512012000300006 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We present a method to estimate the minimum distance of affine varieties codes. Our technique uses properties of the footprint of an ideal obtained by enlarging the defining ideal of the variety, and may be applied also to codes which do not come from the so-called weight domains. |
---|