Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
ON THE MINIMUM DISTANCE OF A TORIC CODE VIA VANISHING IDEAL
Download
BaldemirF_PhD_Thesis_Final_Version.pdf
Date
2023-8-10
Author
Baldemir, Fadime
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
344
views
154
downloads
Cite This
Toric codes are examples of evaluation codes produced by evaluating homogeous polynomials of a fixed degree $\alpha$ at the $\F_q$-rational points of a subset $Y$ of a toric variety $X$. The kernel of the evaluation map is just the subspace $I_{\alpha}(Y)$ generated by the elements of degree $\alpha$. Therefore, it is an important algebraic invariant that determines the parameters of the code. One of the main objective of this thesis is to calculate the minimum distance of an evaluation code obtained from a general smooth toric variety by using $I_{\alpha}(Y)$. Let $I(Y)$ be the ideal generated by all homogeneous polynomials vanishing at all the points of $Y$. We give three algorithms and share a comparative table, discussing the computation time. We use commutative algebraic tools such as the multigraded Hilbert polynomials of ideals derived from $I(Y)$, zero divisors $f$ of $I(Y)$, and primary decomposition of $I(Y)$ to calculate the minimum distance. Their utilization enables us to find a homogeneous polynomial $f$ among all homogeneous polynomials of the same degree which has the maximum number of roots on $Y$. Another primary objective is to focus on the dimension of toric codes obtained from Kleinschmidt toric variety, a generalization of Hirzebruch surfaces. Let $X_{\Sigma_3(l)}$ be a Kleinschmidt toric variety. We compute the dimension of a toric code $\mathcal{C}_{\alpha,Y}$ for any degree $\alpha=(c,d)\in \mathbb N\beta$, for any subgroup $Y=V_{X}(I_L)(\mathbb F_q)$ of the torus $T_{\Sigma_3(l)}$ both algebraically and geometrically by counting the lattice points of the polytope corresponding to $S_\alpha/I_\alpha.$
Subject Keywords
minimum distance, toric code, dimension of a toric code, Kleinschmidt toric variety
URI
https://hdl.handle.net/11511/105102
Collections
Graduate School of Natural and Applied Sciences, Thesis
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
F. Baldemir, “ON THE MINIMUM DISTANCE OF A TORIC CODE VIA VANISHING IDEAL,” Ph.D. - Doctoral Program, Middle East Technical University, 2023.