Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Two new decoding algorithms for Reed-Solomon codes

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

DOI10.1007/BF01196623zbMath0795.94016OpenAlexW2050784748MaRDI QIDQ1311609

Tomik Yaghoobian, Ian F. Blake

Publication date: 25 September 1994

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01196623


zbMATH Keywords

Reed-Solomon codeserror correcting codesVLSI implementationdecoding algorithmsextended Euclidean algorithmBerlekamp-Welch algorithmPeterson algorithm


Mathematics Subject Classification ID

Decoding (94B35)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A VLSI Design of a Pipeline Reed-Solomon Decoder
  • Systolic VLSI Arrays for Polynomial GCD Computation
  • A systolic Reed-Solomon encoder
  • Bit-serial Reed - Solomon encoders
  • Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes
  • A method for solving key equation for decoding goppa codes


This page was built for publication: Two new decoding algorithms for Reed-Solomon codes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1311609&oldid=13423401"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki