Download this article
 Download this article For screen
For printing
Recent Issues

Volume 17
Issue 5, 723–899
Issue 4, 543–722
Issue 3, 363–541
Issue 2, 183–362
Issue 1, 1–182

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1944-4184 (online)
ISSN 1944-4176 (print)
 
Author index
To appear
 
Other MSP journals
This article is available for purchase or by subscription. See below.
On good infinite families of toric codes or the lack thereof

Mallory Dolorfino, Cordelia Horch, Kelly Jabbusch and Ryan Martinez

Vol. 17 (2024), No. 3, 397–423
Abstract

Toric codes, introduced by Hansen, are the natural extensions of Reed–Solomon codes. A toric code is a k-dimensional subspace of 𝔽qn determined by a toric variety or its associated integral convex polytope P [0,q 2]n, where k is equal to |P n| (the number of integer lattice points of P). There are two relevant parameters that determine the quality of a code: the information rate, which measures how much information is contained in a single bit of each codeword, and the relative minimum distance, which measures how many errors can be corrected relative to how many symbols each codeword has. Soprunov and Soprunova defined a good infinite family of codes to be a sequence of codes of unbounded polytope dimension such that neither the corresponding information rates nor relative minimum distances go to 0 in the limit. We examine different ways of constructing families of codes by considering polytope operations such as the join and direct sum. In doing so, we give conditions under which no good family can exist and strong evidence that there is no such good family of codes.

PDF Access Denied

We have not been able to recognize your IP address 3.149.243.29 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recom­mendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 30.00:

Keywords
toric varieties, evaluation codes, toric codes, lattice polytopes
Mathematical Subject Classification
Primary: 94B27
Secondary: 14M25, 52B20
Milestones
Received: 2 February 2022
Revised: 22 February 2023
Accepted: 27 February 2023
Published: 17 July 2024

Communicated by Ravi Vakil
Authors
Mallory Dolorfino
Kalamazoo College
Kalamazoo, MI
United States
Cordelia Horch
Occidental College
Los Angeles, CA
United States
Kelly Jabbusch
Department of Mathematics and Statistics
University of Michigan
Dearborn, MI
United States
Ryan Martinez
Harvey Mudd College
Claremont, CA
United States