THE MINIMUM DISTANCE OF CODES IN AN ARRAY COMING FROM TELESCOPIC SEMIGROUPS

Authors
KIRFEL C PELLIKAAN R
Citation
C. Kirfel et R. Pellikaan, THE MINIMUM DISTANCE OF CODES IN AN ARRAY COMING FROM TELESCOPIC SEMIGROUPS, IEEE transactions on information theory, 41(6), 1995, pp. 1720-1732
Citations number
37
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
41
Issue
6
Year of publication
1995
Part
1
Pages
1720 - 1732
Database
ISI
SICI code
0018-9448(1995)41:6<1720:TMDOCI>2.0.ZU;2-5
Abstract
The concept of an error-correcting array gives a new bound on the mini mum 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 c odes, Moreover, it is explained in terms of linear algebra and the the ory of semigroups only.