Bounding the minimum distance of affine variety codes using symbolic computations of footprints (Q1705516)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6850772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the minimum distance of affine variety codes using symbolic computations of footprints |
scientific article; zbMATH DE number 6850772 |
Statements
Bounding the minimum distance of affine variety codes using symbolic computations of footprints (English)
0 references
16 March 2018
0 references
affine variety codes
0 references
Buchberger's algorithm
0 references
Klein curve
0 references
minimum distance
0 references
0.9337313175201416
0 references
0.8574046492576599
0 references
0.8475791215896606
0 references
0.7993146181106567
0 references
0.7934519052505493
0 references
