Add to ORKGIn this paper we present a decoding algorithm for algebraic geometry codes with error-correcting capacity beyond half the designed distance of the code. This algorithm comes as a fusion of the Power Error Locating Pairs algorithm for algebraic geometry codes and the technique used by Ehrhard in order to correct these codes up to half the designed distance. The decoding radius of this algorithm reaches that of Sudan algorithm, without any penalty given by the genus of the curve
The construction, estimation of minimum distance, and decoding algorithms of algebraic geometry code...
It is shown how decoding beyond the designed distance can be accomplished for a certain decoding alg...
This paper is concerned with a new family of error-correcting codes based on algebraic curves over f...
Abstract-Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented...
Codes derived from algebraic curves are called algebraic geometry (AG) codes. They provide a way to ...
We present a new decoding algorithm based on error locating pairs and correcting an amount of errors...
The basic algorithm for decoding of algebraic-geometric codes corrects up to (dc-1)2-g/2 errors, whe...
C. Shannon presented theoretical conditions under which communication was possible error-free in the...
In this age of information technology, methods must be found that allow errors in data transmission ...
AbstractA new effective decoding algorithm is presented for arbitrary algebraic-geometric codes on t...
The security of the most popular number-theory public key crypto (PKC) systems will be devastatingly...
Error correcting codes are defined and important parameters for a code are explained. Parameters of ...
The coding theory plays an important role in improving the reliability in information and communicat...
Survey chapter to appear in "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and ...
In this paper we give a new lower bound for generalized algebraic geometry codes with which we are a...
The construction, estimation of minimum distance, and decoding algorithms of algebraic geometry code...
It is shown how decoding beyond the designed distance can be accomplished for a certain decoding alg...
This paper is concerned with a new family of error-correcting codes based on algebraic curves over f...
Abstract-Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented...
Codes derived from algebraic curves are called algebraic geometry (AG) codes. They provide a way to ...
We present a new decoding algorithm based on error locating pairs and correcting an amount of errors...
The basic algorithm for decoding of algebraic-geometric codes corrects up to (dc-1)2-g/2 errors, whe...
C. Shannon presented theoretical conditions under which communication was possible error-free in the...
In this age of information technology, methods must be found that allow errors in data transmission ...
AbstractA new effective decoding algorithm is presented for arbitrary algebraic-geometric codes on t...
The security of the most popular number-theory public key crypto (PKC) systems will be devastatingly...
Error correcting codes are defined and important parameters for a code are explained. Parameters of ...
The coding theory plays an important role in improving the reliability in information and communicat...
Survey chapter to appear in "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and ...
In this paper we give a new lower bound for generalized algebraic geometry codes with which we are a...
The construction, estimation of minimum distance, and decoding algorithms of algebraic geometry code...
It is shown how decoding beyond the designed distance can be accomplished for a certain decoding alg...
This paper is concerned with a new family of error-correcting codes based on algebraic curves over f...