On linear codes with large weights simultaneously for the Rosenbloom–Tsfasman and Hamming metrics

We show that maximum distance separable (MDS) codes, or more generally nearly MDS codes, for the Rosenbloom–Tsfasman metric can meet the Gilbert–Varshamov bound for their Hamming weights. The proof is based on a careful analysis of orbits of a linear group preserving the Rosenbloom–Tsfasman metric....

Full description

Saved in:
Bibliographic Details
Published in:Journal of Complexity 2007-08, Vol.23 (4), p.926-936
Main Author: Skriganov, M.M.
Format: Article
Language:English
Subjects:
Coding theory with non-Hamming metrics
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:We show that maximum distance separable (MDS) codes, or more generally nearly MDS codes, for the Rosenbloom–Tsfasman metric can meet the Gilbert–Varshamov bound for their Hamming weights. The proof is based on a careful analysis of orbits of a linear group preserving the Rosenbloom–Tsfasman metric.
ISSN:0885-064X
1090-2708
DOI:10.1016/j.jco.2007.02.004