DECODING OF MATRIX-PRODUCT CODES

DOI10.1142/S021949881250185XzbMath1346.94148arXiv1107.1529WikidataQ62582183 ScholiaQ62582183MaRDI QIDQ4923923

Fernando Hernando, Diego Ruano

Publication date: 27 May 2013

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.1529

zbMATH Keywords

linear codes; minimum distance; decoding algorithm; matrix-product codes

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

94B35: Decoding

Related Items

The Poincaré Polynomial of a Linear Code, A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes, On self-orthogonality and self-duality of matrix-product codes over commutative rings, Matrix-product structure of repeated-root cyclic codes over finite fields, Homogeneous weights of matrix product codes over finite principal ideal rings, New quantum codes from evaluation and matrix-product codes, The hulls of matrix-product codes over commutative rings and applications, Galois hulls of linear codes over finite fields, On matrix-product structure of repeated-root constacyclic codes over finite fields, New stabilizer codes from the construction of dual-containing matrix-product codes, Matrix product codes over finite commutative Frobenius rings, Construction of new quantum codes via Hermitian dual-containing matrix-product codes

Cites Work

• New linear codes from matrix-product codes with polynomial units
• Construction and decoding of matrix-product codes from nested codes
• Matrix-product codes over finite chain rings
• Note on Niederreiter-Xing's propagation rule for linear codes
• Matrix-product codes over \(\mathbb{F}_q\)