Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Using the division algorithm to decode Reed-Solomon codes

From MaRDI portal
Publication:3462895
Jump to:navigation, search

zbMATH Open1340.94096MaRDI QIDQ3462895FDOQ3462895


Authors: Eubanks-Turner Christina, Lennon Matthew, Reynoso Eduardo, Thibodeaux Brandy, Urquiza Amanda, Wheatley Ashley, Young Derek Edit this on Wikidata


Publication date: 15 January 2016





Recommendations

  • Decoding of Reed Solomon codes beyond the error-correction bound
  • A New Algorithm for Decoding Reed-Solomon Codes
  • Two new decoding algorithms for Reed-Solomon codes
  • A Decoding Approach to Reed–Solomon Codes from Their Definition
  • Simple algorithms for decoding systematic Reed-Solomon codes


zbMATH Keywords

Reed-Solomon codedivision algorithmerror-correcting codes


Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Decoding (94B35) Synchronization error-correcting codes (94B50)







This page was built for publication: Using the division algorithm to decode Reed-Solomon codes

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3462895&oldid=16785501"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 20:38. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki