2000 character limit reached
A decoding algorithm for binary linear codes using Groebner bases
Published 9 Oct 2018 in cs.IT and math.IT | (1810.04536v1)
Abstract: It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear codes by utilizing the Groebner bases of the associated ideals.
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.
