On the existence of error-correcting pairs

DOI10.1016/0378-3758(95)00088-7zbMath0852.94025OpenAlexW2139295276MaRDI QIDQ1918201

Pellikaan, Ruud

Publication date: 2 December 1996

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(95)00088-7

zbMATH Keywords

decodingReed-Solomon codeerror-correcting pairsalgebraic geometric codesRoos bound

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Related Items (9)

Rank error-correcting pairs ⋮ A characterization of MDS codes that have an error correcting pair ⋮ A symmetric Roos bound for linear codes ⋮ ECC\(^2\): error correcting code and elliptic curve based cryptosystem ⋮ A Decoding Approach to Reed–Solomon Codes from Their Definition ⋮ The error-correcting pair for TGRS codes ⋮ The properties and the error-correcting pair for lengthened GRS codes ⋮ On the error-correcting pair for MDS linear codes with even minimum distance ⋮ Theory of supports for linear codes endowed with the sum-rank metric

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On decoding by error location and dependent sets of error positions
• On the decoding of algebraic-geometric codes over F/sub q/ for q<or=16
• Which linear codes are algebraic-geometric?
• On a decoding algorithm for codes on maximal curves
• Error-locating pairs for cyclic codes
• On the minimum distance of cyclic codes

This page was built for publication: On the existence of error-correcting pairs