Complexity Analysis of Reed-Solomon Decoding over GF(2m) without Using Syndromes

Zhiyuan Yan, Ning Chen

Open source

DOI
10.1155/2008/843634
Published
06
Container
EURASIP Journal on Wireless Communications and Networking
Publisher
Not recorded
Open access
yes

Credibility signals

uncertain Score 53/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1155/2008/843634,
  title = {Complexity Analysis of Reed-Solomon Decoding over GF(2m) without Using Syndromes},
  author = {Zhiyuan Yan and Ning Chen},
  year = {2008},
  journal = {EURASIP Journal on Wireless Communications and Networking},
  doi = {10.1155/2008/843634},
  url = {https://doi.org/10.1155/2008/843634}
}

RIS

TY  - JOUR
TI  - Complexity Analysis of Reed-Solomon Decoding over GF(2m) without Using Syndromes
AU  - Zhiyuan Yan
AU  - Ning Chen
PY  - 2008
JO  - EURASIP Journal on Wireless Communications and Networking
DO  - 10.1155/2008/843634
UR  - https://doi.org/10.1155/2008/843634
ER  - 

APA

Yan, Z., & Chen, N. (2008). Complexity Analysis of Reed-Solomon Decoding over GF(2m) without Using Syndromes. EURASIP Journal on Wireless Communications and Networking. https://doi.org/10.1155/2008/843634

Source records