Name
Abstract | ||
|---|---|---|
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in $\mathbb{R}^n$. We show that the minimum distance is multiplicative with respect to taking the product of polytopes, and behaves in a simple way when one builds a $k$-dilate of a pyramid over a polytope. This allows us to construct a large class of examples of higher dimensional toric codes where we can compute the minimum distance explicitly. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1137/090762592 | SIAM Journal on Discrete Mathematics |
Keywords | DocType | Volume |
next dimension,minimum distance,bringing toric codes,large class,lattice polytopes,minimum distance computation,higher dimensional toric code,algebraic geometry,information theory | Journal | 24 |
Issue | ISSN | Citations |
2 | SIAM J. Discrete Math. Volume 24, no. 2, pp. 655-665 (2010) | 6 |
PageRank | References | Authors |
0.59 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan Soprunov | 1 | 21 | 3.68 |
| Jenya Soprunova | 2 | 21 | 2.37 |