HELP: a sparse error locator polynomial for BCH codes
type: Item
instance of: scholarly article
title: HELP: a sparse error locator polynomial for BCH codes
zbMATH Open document ID: 1458.94327
author: Michela Ceria
author: Massimiliano Sala
author: Ferdinando Mora
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2020-07-15T00:00:00Z
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 94B15
Mathematics Subject Classification ID: 05E40
Mathematics Subject Classification ID: 13P10
zbMATH DE Number: 7221083
zbMATH Keywords: cyclic codes
zbMATH Keywords: syndrome variety
zbMATH Keywords: locator polynomial
describes a project that uses: ISOLATE
MaRDI profile type: Publication
full work available at URL: s00200-020-00427-x
OpenAlex ID: W3017380014
cites work: The big mother of all dualities. 2: Macaulay bases
cites work: Algebraic coding theory
cites work: The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
cites work: On the Shape of the General Error Locator Polynomial for Cyclic Codes
cites work: Q2966101
cites work: Bar code for monomial ideals
cites work: From algebraic sets to monomial linear bases by means of combinatorial algorithms
cites work: Multivariate interpolation and standard bases for Macaulay modules
cites work: General principles for the algebraic decoding of cyclic codes
cites work: Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
cites work: Q4314353
cites work: Finding BCH error locator polynomials in one step
cites work: The lex game and some applications
cites work: Properties of Gröbner bases under specializations
cites work: Fundamentals of Error-Correcting Codes
cites work: Solving systems of algebraic equations by using gröbner bases
cites work: On the stability of Gröbner bases under specializations
cites work: On the decoding of cyclic codes using Gröbner bases
cites work: Vector space bases associated to vanishing ideals of points
cites work: Gröbner Bases, Coding, and Cryptography
cites work: Correcting errors and erasures via the syndrome variety
cites work: Q4413922
cites work: Q4674258
cites work: Q5251741
cites work: Solving Polynomial Equation Systems
cites work: An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
cites work: Bezoutian and quotient ring structure
cites work: General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula>
cites work: Encoding and error-correction procedures for the Bose-Chaudhuri codes
cites work: Solving zero-dimensional systems through the rational univariate representation
cites work: GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
DOI: 10.1007/S00200-020-00427-X
description: scientific article; zbMATH DE number 7221083