Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Solving the key equation for Hermitian codes with a division algorithm

By: Bouw, I.I.; Bossert, M.; Kampf, S.;

2011 / IEEE / 978-1-4577-0595-3

Description

This item was taken from the IEEE Conference ' Solving the key equation for Hermitian codes with a division algorithm ' This paper presents a division algorithm to solve the key equation for Hermitian codes, which is capable of locating most error patterns with weight up to half the designed minimum distance. The algorithm has a structure similar to the Euclidean algorithm used in the decoding of Reed-Solomon codes, yet it is a little more complex because bivariate polynomials have to be used. We give simulation results for the decoding of several Hermitian codes of various rates over the finite field GF(24) to verify the claims.