New linear codes from matrix-product codes with polynomial units
From MaRDI portal
Abstract: A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.
Recommendations
Cited in
(18)- Homogeneous metric and matrix product codes over finite commutative principal ideal rings
- On matrix-product structure of repeated-root constacyclic codes over finite fields
- Squares of matrix-product codes
- Matrix product codes over finite commutative Frobenius rings
- New quantum codes from matrix-product codes over small fields
- Product construction of affine codes
- Construction of a class of linear codes
- An Elementary Construction of Codes From the Groups of Units of Residue Rings of Polynomials
- The Poincaré polynomial of a linear code
- Inverting construction Y/sub 1/
- DECODING OF MATRIX-PRODUCT CODES
- Linear codes on unitary space
- LCD matrix product codes with an application
- Representation and matrix-product structure of type-1 constacyclic codes over \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
- Galois duality of matrix product codes with applications
- Homogeneous weights of matrix product codes over finite principal ideal rings
- New quantum codes from evaluation and matrix-product codes
- Construction and decoding of matrix-product codes from nested codes
This page was built for publication: New linear codes from matrix-product codes with polynomial units
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540383)
