Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets

DOI10.1023/A:1020834531372zbMath1020.94031OpenAlexW8711903MaRDI QIDQ1862991

Maxim M. Skriganov, Steven T. Dougherty

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

zbMATH Keywords

boundMDS codesfinite alphabetuniformly distributednon-Hamming metriccodes over an arbitrary alphabet

Mathematics Subject Classification ID

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

Related Items (16)

On universally decodable matrices for space-time coding ⋮ Bursts in \(m\)-metric array codes ⋮ On the proximity of large primes ⋮ Campopiano-type bounds in non-Hamming array coding ⋮ Correction of CT burst array errors in the generalized-Lee-RT spaces ⋮ The covering problem in Rosenbloom-Tsfasman spaces ⋮ Niederreiter-Rosenbloom-Tsfasman LCD codes ⋮ ON THE GENERALIZED-LEE-RT-PSEUDO-METRIC (THE GLRTP-METRIC) ARRAY CODES CORRECTING BURST ERRORS ⋮ MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\) ⋮ The complete weight enumerator for codes over \(\mathcal M_{n\times s}(R)\) ⋮ CT bursts-from classical to array coding ⋮ Array Codes in the Generalized Lee-RT Pseudo-Metric (GLRTP-Metric) ⋮ CONSTRUCTION OF m-METRIC ARRAY CODES DETECTING AND CORRECTING CT-BURST ARRAY ERRORS ⋮ Maximum distance separable poset codes ⋮ MDS and \(I\)-perfect poset block codes ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space

Cites Work

• Codes for the \(m\)-metric
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• MDR codes over Z/sub k/
• Unnamed Item
• Unnamed Item
• Unnamed Item

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