New linear codes from matrix-product codes with polynomial units

DOI10.3934/amc.2010.4.363zbMath1213.94176arXiv0903.4826OpenAlexW2019892846WikidataQ62582189 ScholiaQ62582189MaRDI QIDQ540383

Diego Ruano, Fernando Hernando

Publication date: 3 June 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

linear codequasi-cyclic codebounds on the minimum distancematrix-product code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (10)

New quantum codes from matrix-product codes over small fields ⋮ LCD matrix product codes with an application ⋮ The Poincaré Polynomial of a Linear Code ⋮ Matrix product codes over finite commutative Frobenius rings ⋮ Homogeneous metric and matrix product codes over finite commutative principal ideal rings ⋮ DECODING OF MATRIX-PRODUCT CODES ⋮ Homogeneous weights of matrix product codes over finite principal ideal rings ⋮ On matrix-product structure of repeated-root constacyclic codes over finite fields ⋮ New quantum codes from evaluation and matrix-product codes ⋮ Squares of matrix-product codes

Uses Software

• Magma

This page was built for publication: New linear codes from matrix-product codes with polynomial units