DECODING OF MATRIX-PRODUCT CODES
From MaRDI portal
Publication:4923923
DOI10.1142/S021949881250185XzbMATH Open1346.94148arXiv1107.1529WikidataQ62582183 ScholiaQ62582183MaRDI QIDQ4923923FDOQ4923923
Fernando Hernando, Diego Ruano
Publication date: 27 May 2013
Published in: Journal of Algebra and its Applications (Search for Journal in Brave)
Abstract: We propose a decoding algorithm for the -construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error correction capability of the code.
Full work available at URL: https://arxiv.org/abs/1107.1529
Recommendations
- Construction and decoding of matrix-product codes from nested codes
- Decoding Reed-Muller codes over product sets
- Decoding Reed-Muller codes over product sets
- Decoding multivariate multiplicity codes on product sets
- On hard-decision decoding of product codes
- LCP of matrix product codes
- Squares of matrix-product codes
- Matrix-product codes over finite chain rings
- Construction and bound on the performance of matrix-product codes
Cites Work
Cited In (17)
- On self-orthogonality and self-duality of matrix-product codes over commutative rings
- On matrix-product structure of repeated-root constacyclic codes over finite fields
- Decoding multivariate multiplicity codes on product sets
- Construction of new quantum codes via Hermitian dual-containing matrix-product codes
- The Poincaré Polynomial of a Linear Code
- Matrix-product structure of repeated-root cyclic codes over finite fields
- On the \(\sigma\) duals and \(\sigma\) hulls of linear codes
- Title not available (Why is that?)
- Representation and matrix-product structure of type-1 constacyclic codes over \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
- Homogeneous weights of matrix product codes over finite principal ideal rings
- A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes
- New quantum codes from evaluation and matrix-product codes
- The hulls of matrix-product codes over commutative rings and applications
- Matrix product codes over finite commutative Frobenius rings
- New stabilizer codes from the construction of dual-containing matrix-product codes
- On dual-containing, almost dual-containing matrix-product codes and related quantum codes
- Galois hulls of linear codes over finite fields
This page was built for publication: DECODING OF MATRIX-PRODUCT CODES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923923)
