DocumentCode
1086172
Title
The minimum distance of codes in an array coming from telescopic semigroups
Author
Kirfel, Christoph ; Pellikaan, Ruud
Author_Institution
Bergen Laererhogskole, Landaas, Norway
Volume
41
Issue
6
fYear
1995
fDate
11/1/1995 12:00:00 AM
Firstpage
1720
Lastpage
1732
Abstract
The concept of an error-correcting array gives a new bound on the minimum distance of linear codes and a decoding algorithm which decodes up to half this bound. This gives a unified point of view which explains several improvements on the minimum distance of algebraic-geometric codes. Moreover, it is explained in terms of linear algebra and the theory of semigroups only
Keywords
Goppa codes; algebraic geometric codes; decoding; error correction codes; linear algebra; linear codes; algebraic-geometric codes; bound; decoding algorithm; error-correcting array; linear algebra; linear codes; minimum distance; telescopic semigroups; Linear algebra;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.476245
Filename
476245
Link To Document