Add to ORKGWe 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
This paper presents encoding and decoding algorithms for several families of optimal rank metric cod...
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The min...
The support of an [n, k] linear code C over a finite field $F_{q}$ is the set of all coordinate posi...
We consider matrix-product codes [C1 ... Cs] · A, where C1, ..., Cs are nested linear codes and mat...
We propose a decoding algorithm for the (u | u+ v)-construction that decodes up to half of the minim...
We propose a decoding algorithm for the (u | u + v)-construction that decodes up to half of the mini...
A list decoding algorithm for matrix-product codes is provided when C1,..., Cs are nested linear cod...
Producción CientíficaWe propose a decoding algorithm for the (u|u+v)-construction that decodes up to...
A list decoding algorithm for matrix-product codes is provided when C1, . . . , Cs are nested linear...
Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code ...
Tim Blackmore and Graham H. Norton introduced the notion of matrix-product codes over finite fields....
The component-wise or Schur product $C*C'$ of two linear error-correcting codes $C$ and $C'$ over ce...
Error-correcting pairs were introduced as a general method of decoding linear codes with respect to ...
AbstractThe support of an [n,k] linear code C over a finite field Fq is the set of all coordinate po...
A new construction of codes from old ones is considered, it is an extension of the matrix-product co...
This paper presents encoding and decoding algorithms for several families of optimal rank metric cod...
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The min...
The support of an [n, k] linear code C over a finite field $F_{q}$ is the set of all coordinate posi...
We consider matrix-product codes [C1 ... Cs] · A, where C1, ..., Cs are nested linear codes and mat...
We propose a decoding algorithm for the (u | u+ v)-construction that decodes up to half of the minim...
We propose a decoding algorithm for the (u | u + v)-construction that decodes up to half of the mini...
A list decoding algorithm for matrix-product codes is provided when C1,..., Cs are nested linear cod...
Producción CientíficaWe propose a decoding algorithm for the (u|u+v)-construction that decodes up to...
A list decoding algorithm for matrix-product codes is provided when C1, . . . , Cs are nested linear...
Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code ...
Tim Blackmore and Graham H. Norton introduced the notion of matrix-product codes over finite fields....
The component-wise or Schur product $C*C'$ of two linear error-correcting codes $C$ and $C'$ over ce...
Error-correcting pairs were introduced as a general method of decoding linear codes with respect to ...
AbstractThe support of an [n,k] linear code C over a finite field Fq is the set of all coordinate po...
A new construction of codes from old ones is considered, it is an extension of the matrix-product co...
This paper presents encoding and decoding algorithms for several families of optimal rank metric cod...
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The min...
The support of an [n, k] linear code C over a finite field $F_{q}$ is the set of all coordinate posi...