The minimum distance of codes in an array coming from telescopic semigroups

C. Kirfel; G.R. Pellikaan

doi:10.1109/18.476245

The minimum distance of codes in an array coming from telescopic semigroups

C. Kirfel, G.R. Pellikaan

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

110 Citaten (Scopus)

Samenvatting

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.

Originele taal-2	Engels
Pagina's (van-tot)	1720-1732
Tijdschrift	IEEE Transactions on Information Theory
Volume	41
Nummer van het tijdschrift	6/1
DOI's	https://doi.org/10.1109/18.476245
Status	Gepubliceerd - 1995

Toegang tot document

10.1109/18.476245

Citeer dit

@article{9c00ed29003542138df3a1df9f9379a7,

title = "The minimum distance of codes in an array coming from telescopic semigroups",

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.",

author = "C. Kirfel and G.R. Pellikaan",

year = "1995",

doi = "10.1109/18.476245",

language = "English",

volume = "41",

pages = "1720--1732",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "6/1",

}

TY - JOUR

T1 - The minimum distance of codes in an array coming from telescopic semigroups

AU - Kirfel, C.

AU - Pellikaan, G.R.

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

U2 - 10.1109/18.476245

DO - 10.1109/18.476245

M3 - Article

SN - 0018-9448

VL - 41

SP - 1720

EP - 1732

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6/1

ER -

The minimum distance of codes in an array coming from telescopic semigroups

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit