Homogeneous Weights of Matrix Product Codes over Finite Principal Ideal Rings
Yun Fan, San Ling, Hongwei Liu
TL;DR
This paper investigates the homogeneous weights of matrix product codes over finite principal ideal rings and establishes a lower bound for their minimum homogeneous weights.
Contribution
It provides the first analysis of homogeneous weights for these codes and derives a new lower bound for their minimum weights.
Findings
Derived a lower bound for minimum homogeneous weights.
Extended the understanding of weight properties over finite principal ideal rings.
Contributed to coding theory by analyzing matrix product codes.
Abstract
In this paper, the homogeneous weights of matrix product codes over finite principal ideal rings are studied and a lower bound for the minimum homogeneous weights of such matrix product codes is obtained.
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 · Cooperative Communication and Network Coding · Advanced Wireless Network Optimization