| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401415 | Journal of Symbolic Computation | 2013 | 8 Pages |
Abstract
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a [36,19,12]-code over F7 whose minimum distance 12 exceeds that of all previously known codes.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
