New Linear Codes from Matrix-Product Codes with Polynomial Units
Fernando Hernando, Diego Ruano

TL;DR
This paper introduces a novel method for constructing linear codes by extending matrix-product codes with polynomial units, resulting in codes with improved parameters over existing ones.
Contribution
It presents a new code construction technique based on matrix-product codes with polynomial units, enhancing code parameters compared to prior methods.
Findings
Several improved linear codes are constructed.
The new codes outperform known codes in certain parameters.
The method extends existing matrix-product code frameworks.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
