Maximum distance separable codes in the metric over arbitrary alphabets

DOI10.1023/A:1020834531372zbMATH Open1020.94031OpenAlexW8711903MaRDI QIDQ1862991FDOQ1862991

Authors: Steven T. Dougherty, M. M. Skriganov 

Publication date: 11 March 2003

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020834531372

Recommendations

• Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions
• scientific article; zbMATH DE number 949677
• Maximum distance separable codes over ℤ2 × ℤ2s
• scientific article
• On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics

zbMATH Keywords

boundMDS codesfinite alphabetuniformly distributednon-Hamming metriccodes over an arbitrary alphabet

Mathematics Subject Classification ID

General theory of distribution modulo (1) (11K06) Other types of codes (94B60)

Cites Work

• Title not available (Why is that?)
• Codes for the \(m\)-metric
• Title not available (Why is that?)
• Title not available (Why is that?)
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• MDR codes over Z/sub k/

Cited In (26)

• Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
• On universally decodable matrices for space-time coding
• AN ALGORITHMIC APPROACH TO ACHIEVE MINIMUM $\\rho$-DISTANCE AT LEAST d IN LINEAR ARRAY CODES
• ON THE GENERALIZED-LEE-RT-PSEUDO-METRIC (THE GLRTP-METRIC) ARRAY CODES CORRECTING BURST ERRORS
• A novel maximum distance separable code to generate universal identifiers
• CONSTRUCTION OF m-METRIC ARRAY CODES DETECTING AND CORRECTING CT-BURST ARRAY ERRORS
• Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions
• On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics
• The complete weight enumerator for codes over \(\mathcal M_{n\times s}(R)\)
• Correction of CT burst array errors in the generalized-Lee-RT spaces
• The covering problem in Rosenbloom-Tsfasman spaces
• Bursts in \(m\)-metric array codes
• Campopiano-type bounds in non-Hamming array coding
• Maximum distance separable poset codes
• Codes in \(\alpha\)-metric
• A class of \(\rho\)-frame codes for deep space communication
• The partition weight enumerator and bounds on MDS codes
• Array codes in the generalized Lee-RT pseudo-metric (GLRTP-metric)
• Fractional decoding and the Rosenbloom-Tsfasman metric
• On the proximity of large primes
• Maximum distance separable codes over ℤ2 × ℤ2s
• Lowest density MDS codes over extension alphabets
• MDS and \(I\)-perfect poset block codes
• CT bursts-from classical to array coding
• Niederreiter-Rosenbloom-Tsfasman LCD codes
• MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)

This page was built for publication: Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862991)