2021/02/06 by Mahir Bilen Can, Takayuki Hibi, Can, Mahir Bilen +1
Computer Science · Engineering · Mathematics · #Artificial intelligence #Bipartite graph #Business #Class (philosophy) #Coding theory and cryptography #Combinatorics #Combinatorics (math.CO) #Computer science #Discrete mathematics #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Mathematics #Order (exchange) #Partially ordered set #Polynomial and algebraic computation #Polytope #Polytope model #Relation (database) #Statistics #Toric variety #Tree (set theory) #Variety (cybernetics) #cs.IT #graph theory and CDMA systems #math.CO #math.IT
paper · pdf · doi:10.48550/arxiv.2102.03651
published in arXiv (Cornell University) (Cornell University) · To appear in Discrete and Computational Geometry
openalex publication_date 2021/02/06 · arxiv created 2021/07/27 · arxiv updated 2021/07/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
In this article we investigate a class of linear error correcting codes in relation with the order polytopes. In particular we consider the order polytopes of tree posets and bipartite posets. We calculate the parameters of the associated toric variety codes.