Complexity of Decoding Positive-Rate Reed-Solomon Codes

DOI10.1007/978-3-540-70575-8_24zbMath1153.94468arXiv0802.1220OpenAlexW1598407298MaRDI QIDQ3521927

Qi Cheng, Daqing Wan

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (3)

A new sieve for distinct coordinate counting ⋮ On Reed-Solomon codes ⋮ A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem

This page was built for publication: Complexity of Decoding Positive-Rate Reed-Solomon Codes