AI Chat AI Image Generator AI Video Text to Speech

Decoding binary Reed-Muller codes via Groebner bases

08/29/2018
∙
by   Harinaivo Andriatahiny, et al.
∙
0
∙

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 10/09/2018

A decoding algorithm for binary linear codes using Groebner bases

It has been discovered that linear codes may be described by binomial id...
0 Harinaivo Andriatahiny, et al. ∙
research
∙ 03/26/2019

Binary LCD Codes from Z_2Z_2[u]

Linear complementary dual (LCD) codes over finite fields are linear code...
0 Hu Peng, et al. ∙
research
∙ 04/10/2017

Modular Techniques For Noncommutative Gröbner Bases

In this note, we extend modular techniques for computing Gröbner bases f...
0 Wolfram Decker, et al. ∙
research
∙ 11/22/2016

Groebner Bases for Everyone with CoCoA-5 and CoCoALib

We present a survey on the developments related to Groebner bases, and s...
0 John Abbott, et al. ∙
research
∙ 07/06/2018

Design of Low-Complexity Convolutional Codes over GF(q)

This paper proposes a new family of recursive systematic convolutional c...
0 Rami Klaimi, et al. ∙
research
∙ 03/13/2023

Finding the minimum distance and decoding linear codes with Gaussian Elimination Method

We propose an algorithm using the Gaussian elimination method to find th...
0 Tianshuo Yang, et al. ∙
research
∙ 01/13/2018

Waring's Theorem for Binary Powers

A natural number is a binary k'th power if its binary representation con...
0 Daniel M. Kane, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal