A characterization of MDS codes that have an error correcting pair

DOI10.1016/J.FFA.2016.04.004zbMATH Open1366.94680arXiv1508.02187OpenAlexW4301435565MaRDI QIDQ285480FDOQ285480

Authors: Irene Márquez-Corbella, Ruud Pellikaan 

Publication date: 19 May 2016

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: Error-correcting pairs were introduced in 1988 by R. Pellikaan, and were found independently by R. K"otter (1992), as a general algebraic method of decoding linear codes. These pairs exist for several classes of codes. However little or no study has been made for characterizing those codes. This article is an attempt to fill the vacuum left by the literature concerning this subject. Since every linear code is contained in an MDS code of the same minimum distance over some finite field extension we have focused our study on the class of MDS codes. Our main result states that an MDS code of minimum distance $2t+1$ has a $t$-ECP if and only if it is a generalized Reed-Solomon code. A second proof is given using recent results Mirandola and Z'emor (2015) on the Schur product of codes.

Full work available at URL: https://arxiv.org/abs/1508.02187

Recommendations

• On the error-correcting pair for MDS linear codes with even minimum distance
• New constructions of MDS symbol-pair codes
• On the existence of error-correcting pairs
• The error-correcting pair for TGRS codes
• Rank error-correcting pairs

zbMATH Keywords

error-correcting pairsGRS codesMDS codes

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Title not available (Why is that?)
• Orthogonal Arrays of Index Unity
• On decoding by error location and dependent sets of error positions
• Polynomial Codes Over Certain Finite Fields
• Title not available (Why is that?)
• Fundamentals of Error-Correcting Codes
• Algebraic curves over a finite field
• Algebraic function fields and codes
• Title not available (Why is that?)
• On the edge-independence number and edge-covering number for regular graphs
• The automorphism groups of Reed-Solomon codes
• Finite geometries, varieties and codes
• On the existence of error-correcting pairs
• Maximum distance separable codes and arcs in projective spaces
• Critical Pairs for the Product Singleton Bound
• Title not available (Why is that?)
• On a decoding algorithm for codes on maximal curves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Error-locating pairs for cyclic codes
• Title not available (Why is that?)
• The Weights in MDS Codes
• An Upper Bound of Singleton Type for Componentwise Products of Linear Codes
• Existence results for rational normal curves
• Maximum distance<tex>q</tex>-nary codes
• Isogonal Conjugates: A new approach to certain Geometrical Theorems and to a General Theory of Conics
• Arcs in PG(n,q), MDS-codes and three fundamental problems of B. Segre - some extensions

Cited In (13)

• Enhanced public key security for the McEliece cryptosystem
• MDS array codes for correcting a single criss-cross error
• The properties and the error-correcting pair for lengthened GRS codes
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• A new approach based on quadratic forms to attack the McEliece cryptosystem
• A characterization of certain Griesmer codes: MMD codes in a more general sense
• Square code attack on a modified Sidelnikov cryptosystem
• On the existence of error-correcting pairs
• The error-correcting pair for direct sum codes
• The error-correcting pair for TGRS codes
• Private information retrieval from locally repairable databases with colluding servers
• On the error-correcting pair for MDS linear codes with even minimum distance
• Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes

This page was built for publication: A characterization of MDS codes that have an error correcting pair

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285480)