About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Interpreted as:

journal:(I AND E AND E AND E AND Transactions AND on AND Information AND Theory) AND title:(Algebraic-Geometry AND Codes)

Suggestions: Include records that partially match the query

Filter results
Access
Type
Language
Year
From DTU
Advanced
1 Journal article

Algebraic-Geometry Codes

The theory of error-correcting codes derived from curves in an algebraic geometry was initiated by the work of Goppa as generalizations of Bose-Chaudhuri-Hocquenghem (BCH), Reed-Solomon (RS), and Goppa codes. The development of the theory has received intense consideration since that time

Year: 1998

Language: English

ipgfh l cm bajneokd
2 Journal article

Performance analysis of a decoding algorithm for algebraic-geometry codes

The fast decoding algorithm for one point algebraic-geometry codes of Sakata, Elbrond Jensen, and Hoholdt corrects all error patterns of weight less than half the Feng-Rao minimum distance. In this correspondence we analyze the performance of the algorithm for heavier error patterns. It turns out

Year: 1999

Language: English

pnhc albdemgj ikf o
3 Journal article

Construction and decoding of a class of algebraic geometry codes

A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result

Year: 1989

Language: English

ckpim aj heon dfglb
4 Journal article · Conference paper

Fast Erasure-and error decoding of algebraic geometry codes up to the Feng-Rao bound

This correspondence gives an errata (that is erasure-and error-) decoding algorithm of one-point algebraic-geometry codes up to the Feng-Rao designed minimum distance using Sakata's multidimensional generalization of the Berlekamp-Massey algorithm and the voting procedure of Feng and Rao.

Year: 1998

Language: English

j nlmadhckfebgp io

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user