RMIT University
Browse

Construction and decoding of matrix-product codes from nested codes

journal contribution
posted on 2024-11-01, 07:01 authored by F Hernando, Kristine Lally, D Ruano
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.

History

Related Materials

  1. 1.
    DOI - Is published in 10.1007/s00200-009-0113-5
  2. 2.
    ISSN - Is published in 09381279

Journal

Journal Applicable Algebra in Engineering, Communication and Computing

Volume

20

Issue

5

Start page

497

End page

507

Total pages

11

Publisher

Springer Berlin

Place published

Heidelberg

Language

English

Copyright

© Springer-Verlag 2009

Former Identifier

2006015098

Esploro creation date

2020-06-22

Fedora creation date

2010-11-19

Usage metrics

    Scholarly Works

    Categories

    Keywords

    decoding algorithmlinear codesmatrix-product codesminimum distancequasi-cyclic codes

    Licence

    All rights reserved

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC