Decoding of Lifted Affine-Invariant Codes

by   Lukas Holzbaur, et al.

Lifted Reed-Solomon codes, a subclass of lifted affine-invariant codes, have been shown to be of high rate while preserving locality properties similar to generalized Reed-Muller codes, which they contain as subcodes. This work introduces a simple bounded distance decoder for (subcodes of) lifted affine-invariant codes that is guaranteed to decode up to almost half of their minimum distance. Further, long q-ary lifted affine-invariant codes are shown to correct almost all error patterns of relative weight q-1/q-ϵ for ϵ>0.


page 1

page 2

page 3

page 4


Affine Symplectic Grassmann codes

In this manuscript, we introduce a new class of linear codes, called aff...

Affine invariant triangulations

We study affine invariant 2D triangulation methods. That is, methods tha...

Linear Codes Of 2-Designs As Subcodes Of The Extended Generalized Reed-Muller Codes

This paper is concerned with the affine-invariant ternary codes which ar...

High dimensional affine codes whose square has a designed minimum distance

Given a linear code C, its square code C^(2) is the span of all componen...

A Grassmannian Graph Approach to Affine Invariant Feature Matching

In this work, we present a novel and practical approach to address one o...

Affine Cartesian codes with complementary duals

A linear code C with the property that C ∩ C^ = {0 } is said to be a lin...

From primary to dual affine variety codes over the Klein quartic

In [17] a novel method was established to estimate the minimum distance ...