Fractional decoding and the Rosenbloom-Tsfasman metric
From MaRDI portal
Publication:6646804
DOI10.3934/amc.2023061MaRDI QIDQ6646804
Publication date: 3 December 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
array codesRosenbloom-Tsfasman metricdistributed storage systemprobabilistic decodingfractional decoding
Linear codes (general theory) (94B05) Bounds on codes (94B65) Information storage and retrieval of data (68P20) Decoding (94B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bursts in \(m\)-metric array codes
- A combinatorial problem for vector spaces over finite fields
- Codes for the \(m\)-metric
- The complete weight enumerator for codes over \(\mathcal M_{n\times s}(R)\)
- Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
- Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions
- Codes with a poset metric
- On Rosenbloom and Tsfasman's generalization of the Hamming space
- MACWILLIAMS IDENTITIES FOR WEIGHT ENUMERATORS WITH RESPECT TO THE RT METRIC
- BCH Codes for the Rosenbloom–Tsfasman Metric
- Poset Codes: Partial Orders, Metrics and Coding Theory
- Bounds on ordered codes and orthogonal arrays
- A class of Sudan-decodable codes
- Network Coding for Distributed Storage Systems
- Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
- Polynomial Invariant Theory and Shape Enumerator of Self-Dual Codes in the NRT-Metric
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
- Fractional decoding of \(r\)-Hermitian codes
- Niederreiter-Rosenbloom-Tsfasman LCD codes
This page was built for publication: Fractional decoding and the Rosenbloom-Tsfasman metric
