2000 character limit reached
Standard Bases for Linear Codes over Prime Fields
Published 18 Aug 2017 in cs.IT and math.IT | (1708.05490v1)
Abstract: It is known that a linear code can be represented by a binomial ideal. In this paper, we give standard bases for the ideals in a localization of the multivariate polynomial ring in the case of linear codes over prime fields.
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.
