Matrix product codes over finite commutative Frobenius rings

Authors:
Yun Fan;San Ling;Hongwei Liu
Affiliations:
School of Mathematics and Statistics, Central China Normal University, Wuhan, China 430079;Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, Singapore, Singapore 637616;School of Mathematics and Statistics, Central China Normal University, Wuhan, China 430079
Venue:
Designs, Codes and Cryptography
Year:
2014

Citing 9
Cited 0

Coding and information theory

Coding and information theory
On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings

Designs, Codes and Cryptography
Matrix-product codes over finite chain rings

Applicable Algebra in Engineering, Communication and Computing
Construction and decoding of matrix-product codes from nested codes

Applicable Algebra in Engineering, Communication and Computing
On the Hamming distance of linear codes over a finite chain ring

IEEE Transactions on Information Theory
On the algebraic structure of quasi-cyclic codes .I. Finite fields

IEEE Transactions on Information Theory
A generalization of Niederreiter-Xing's propagation rule and its commutativity with duality

IEEE Transactions on Information Theory
The Z4-linearity of Kerdock, Preparata, Goethals, and related codes

IEEE Transactions on Information Theory
Coset codes. II. Binary lattices and related codes

IEEE Transactions on Information Theory - Part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes.