MATRIX PRODUCT CODES WITH ROSENBLOOM-TSFASMAN METRIC

In this article, the Rosenbloom-Tsfasman metric of matrix product codes over finite commutative rings is studied and the lower bounds for the minimal Rosenbloom- Tsfasman distances of the matrix product codes axe obtained. The lower bounds of the dual codes of matrix product codes over finite commut...

Full description

Saved in:
Bibliographic Details
Published in:Acta mathematica scientia 2013-05, Vol.33 (3), p.687-700
Main Author: 陈博聪 林丽仁 刘宏伟
Format: Article
Language:English
Subjects:
13A99
15A33
94B05
94B65
Finite commutative Frobenius ring
Lower bounds
Mathematical analysis
matrix product code
Rings (mathematics)
Rosenbloom-Tsfasman metric
下限
产品代码
公制
有限交换环
距离矩阵
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article, the Rosenbloom-Tsfasman metric of matrix product codes over finite commutative rings is studied and the lower bounds for the minimal Rosenbloom- Tsfasman distances of the matrix product codes axe obtained. The lower bounds of the dual codes of matrix product codes over finite commutative Frobenius rings are also given.
ISSN:0252-9602
1572-9087
DOI:10.1016/S0252-9602(13)60030-2