Hermitian codes as generalized Reed-Solomon codes
From MaRDI portal
Publication:1200300
DOI10.1007/BF00124208zbMath0756.94011OpenAlexW2170495079MaRDI QIDQ1200300
Tomik Yaghoobian, Ian F. Blake
Publication date: 16 January 1993
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00124208
decoding algorithmHermitian curvesHermitian codesencoding algorithmconcatenated generalized Reed-Solomon codes
Related Items (2)
On the structure of Hermitian codes ⋮ Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
Cites Work
- Unnamed Item
- Unnamed Item
- On a decoding algorithm for codes on maximal curves
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Remarks on codes from Hermitian curves (Corresp.)
- A note on Hermitian codes over GF(q/sup 2/)
- Construction and decoding of a class of algebraic geometry codes
This page was built for publication: Hermitian codes as generalized Reed-Solomon codes