Papers
Topics
Authors
Recent
Search
2000 character limit reached

Decoding binary Reed-Muller codes via Groebner bases

Published 29 Aug 2018 in cs.IT and math.IT | (1808.09616v1)

Abstract: The binary Reed-Muller codes can be characterized as the radical powers of a modular algebra. We use the Groebner bases to decode these codes.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up