AI Chat AI Image Generator AI Video Text to Speech

A Linear Algebraic Approach to Subfield Subcodes of GRS Codes

03/11/2018

∙

by Christian Senger, et al.

∙

∙

The problem of finding subfield subcodes of generalized Reed-Solomon (GRS) codes (i.e., alternant codes) is considered. A pure linear algebraic approach is taken in order to derive message constraints that generalize the well known conjugacy constraints for cyclic GRS codes and their Bose-Chaudhuri-Hocquenghem (BCH) subfield subcodes. It is shown that the presented technique can be used for finding nested subfield subcodes with increasing design distance.

Christian Senger
2 publications
Rohit Bohara
1 publication

page 1

page 2

page 3

page 4

research

∙ 12/30/2017

Vectorial Boolean functions and linear codes in the context of algebraic attacks

In this paper we study the relationship between vectorial (Boolean) func...

0 Mouna Boumezbeur, et al. ∙

research

∙ 01/24/2023

Several families of ternary negacyclic codes and their duals

Constacyclic codes contain cyclic codes as a subclass and have nice alge...

0 Zhonghua Sun, et al. ∙

research

∙ 06/01/2021

On cyclic algebraic-geometry codes

In this paper we initiate the study of cyclic algebraic geometry codes. ...

0 Gustavo Cabaña, et al. ∙

research

∙ 08/11/2022

Two Classes of Constacyclic Codes with Variable Parameters

Constacyclic codes over finite fields are a family of linear codes and c...

0 Zhonghua Sun, et al. ∙

research

∙ 12/27/2018

Skew Cyclic Codes Over F_4 R

This paper considers a new alphabet set, which is a ring that we call F_...

0 Nasreddine Benbelkacem, et al. ∙

research

∙ 10/08/2020

Finding descending sequences through ill-founded linear orders

In this work we investigate the Weihrauch degree of the problem 𝖣𝖲 of fi...

0 Jun Le Goh, et al. ∙

research

∙ 11/29/2017

F_q[G]-modules and G-invariant codes

If F_q is a finite field and G is a subgroup of the linear automorphisms...

0 Elias Javier Garcia Claro, et al. ∙