Construction and decoding of matrix-product codes from nested codes

Fernando Hernando; Kristine Lally; Diego Ruano Benito

doi:10.1007/s00200-009-0113-5

Construction and decoding of matrix-product codes from nested codes

Fernando Hernando, Kristine Lally, Diego Ruano Benito

Department of Mathematical Sciences

Research output: Contribution to journal › Journal article › Research › peer-review

31 Citations (Scopus)

Abstract

We consider matrix-product codes [C₁ ... C_s] · A, where C₁, ..., C_sare nested linear codes and matrix A has full rank. We compute their minimum distance and provide a decoding algorithm when A is a non-singular by columns matrix. The decoding algorithm decodes up to half of the minimum distance.

Original language	English
Journal	Applicable Algebra in Engineering, Communication and Computing
Volume	20
Issue number	5-6
Pages (from-to)	497-507
ISSN	0938-1279
DOIs	https://doi.org/10.1007/s00200-009-0113-5
Publication status	Published - 2009

Access to Document

10.1007/s00200-009-0113-5

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@article{51061d50db5211dea3f5000ea68e967b,

title = "Construction and decoding of matrix-product codes from nested codes",

abstract = "We consider matrix-product codes [C1 ... Cs] · A, where C1, ..., Cs are nested linear codes and matrix A has full rank. We compute their minimum distance and provide a decoding algorithm when A is a non-singular by columns matrix. The decoding algorithm decodes up to half of the minimum distance.",

author = "Fernando Hernando and Kristine Lally and Benito, {Diego Ruano}",

year = "2009",

doi = "10.1007/s00200-009-0113-5",

language = "English",

volume = "20",

pages = "497--507",

journal = "Applicable Algebra in Engineering, Communication and Computing",

issn = "0938-1279",

publisher = "Physica-Verlag",

number = "5-6",

}

TY - JOUR

T1 - Construction and decoding of matrix-product codes from nested codes

AU - Hernando, Fernando

AU - Lally, Kristine

AU - Benito, Diego Ruano

PY - 2009

Y1 - 2009

N2 - We consider matrix-product codes [C1 ... Cs] · A, where C1, ..., Cs are nested linear codes and matrix A has full rank. We compute their minimum distance and provide a decoding algorithm when A is a non-singular by columns matrix. The decoding algorithm decodes up to half of the minimum distance.

AB - We consider matrix-product codes [C1 ... Cs] · A, where C1, ..., Cs are nested linear codes and matrix A has full rank. We compute their minimum distance and provide a decoding algorithm when A is a non-singular by columns matrix. The decoding algorithm decodes up to half of the minimum distance.

U2 - 10.1007/s00200-009-0113-5

DO - 10.1007/s00200-009-0113-5

M3 - Journal article

SN - 0938-1279

VL - 20

SP - 497

EP - 507

JO - Applicable Algebra in Engineering, Communication and Computing

JF - Applicable Algebra in Engineering, Communication and Computing

IS - 5-6

ER -

Construction and decoding of matrix-product codes from nested codes

Abstract

Access to Document

AUB Link

Fingerprint

Cite this