Homogeneous weights of matrix product codes over finite principal ideal rings
From MaRDI portal
Publication:740314
DOI10.1016/J.FFA.2014.05.004zbMATH Open1332.94112arXiv1304.1405OpenAlexW2049767466MaRDI QIDQ740314FDOQ740314
Authors: Yun Fan, San Ling, Hongwei Liu
Publication date: 2 September 2014
Published in: Finite Fields and their Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1304.1405
Recommendations
- Homogeneous metric and matrix product codes over finite commutative principal ideal rings
- scientific article; zbMATH DE number 2154128
- On bounds for codes over Frobenius rings under homogeneous weights
- One-homogeneous weight codes over finite chain rings
- Further results on higher weights of codes over finite rings
Linear codes (general theory) (94B05) Bounds on codes (94B65) Other types of codes (94B60) Finite commutative rings (13M99)
Cites Work
- A metric for codes over residue class rings
- Weighted modules and representations of codes
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- Title not available (Why is that?)
- Duality for modules over finite rings and applications to coding theory
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
- Note on Niederreiter-Xing's propagation rule for linear codes
- Matrix product codes over finite commutative Frobenius rings
- DECODING OF MATRIX-PRODUCT CODES
- Matrix-product codes over \(\mathbb{F}_q\)
- Construction and decoding of matrix-product codes from nested codes
- Matrix-product codes over finite chain rings
- Code equivalence characterizes finite Frobenius rings
- Homogeneous weights and Möbius functions on finite rings
- New linear codes from matrix-product codes with polynomial units
- Construction and bound on the performance of matrix-product codes
Cited In (12)
- Homogeneous metric and matrix product codes over finite commutative principal ideal rings
- Partitions of Frobenius rings induced by the homogeneous weight
- Construction of new quantum codes via Hermitian dual-containing matrix-product codes
- Matrix-product structure of repeated-root cyclic codes over finite fields
- On the \(\sigma\) duals and \(\sigma\) hulls of linear codes
- On the structure of repeated-root polycyclic codes over local rings
- Matrix-product codes over commutative rings and constructions arising from \((\sigma,\delta)\)-codes
- New stabilizer codes from the construction of dual-containing matrix-product codes
- On dual-containing, almost dual-containing matrix-product codes and related quantum codes
- Determinants of matrices over commutative finite principal ideal rings
- New quantum codes from matrix-product codes over small fields
- Homogeneous weights and Möbius functions on finite rings
This page was built for publication: Homogeneous weights of matrix product codes over finite principal ideal rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740314)