2000 character limit reached
Small polygons and toric codes
Published 1 Apr 2012 in math.CO, cs.IT, and math.IT | (1204.0248v1)
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 F_7 whose minimum distance 12 exceeds that of all previously known codes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.