A characterization of MDS codes that have an error correcting pair

DOI10.1016/J.FFA.2016.04.004MaRDI QIDQ285480zbMATH OpenOpenAlexFDO

Authors Irene Márquez-Corbella, Ruud Pellikaan

Publication date 19 May 2016

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

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

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)

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.

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

Cites work

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

Cited in

(13)

• Enhanced public key security for the McEliece cryptosystem
• MDS array codes for correcting a single criss-cross error
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• The properties and the error-correcting pair for lengthened GRS 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)