REVIEW 7 cited by
Sum-rank metric codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Sum-rank metric codes
read the original abstract
Sum-rank metric codes are a natural extension of both linear block codes and rank-metric codes. They have several applications in information theory, including multishot network coding and distributed storage systems. The aim of this chapter is to present the mathematical theory of sum-rank metric codes, paying special attention to the $\mathbb{F}_q$-linear case in which different sizes of matrices are allowed. We provide a comprehensive overview of the main results in the area. In particular, we discuss invariants, optimal anticodes, and MSRD codes. In the last section, we concentrate on $\mathbb{F}_{q^m}$-linear codes.
Forward citations
Cited by 7 Pith papers
-
A $q$-analogue of the rational normal curve and linearized Reed-Solomon codes
Introduces a q-analogue of the rational normal curve to give a geometric characterization of linearized Reed-Solomon codes and analyze the Hilbert function of the associated coordinate ring.
-
Codes and designs in multivariate $Q$-polynomial association schemes
Generalizes Delsarte bounds and Rao bounds to multivariate Q-polynomial association schemes, deriving upper bounds on code sizes and characterizing tight designs via Wilson polynomial analogues.
-
On the Etzion-Silberstein conjecture for block Ferrers diagrams
MSRD-constructible block Ferrers diagrams attain the Etzion–Silberstein bound over large fields, and reduce to block-triangular cases that yield new arbitrary-field optimal codes for extremal distances.
-
Function-Correcting Codes for Sum-Rank Metric
Function-correcting sum-rank codes admit a Plotkin-like redundancy bound and achieve optimal redundancy ceil(2t/m) for 2t-locally binary functions via an explicit parity construction.
-
Function-Correcting Codes for Sum-Rank Metric
Function-correcting codes are extended to the sum-rank metric, with a Plotkin-like bound on irregular-distance codes and optimal-redundancy constructions for locally binary and weight functions.
-
Decoded Quantum Interferometry Beyond Hamming: Rank-Metric and Translation Association Schemes
Decoded quantum interferometry is generalized to translation association schemes, reducing analysis to tridiagonal eigenvalue problems, with a finite-field matrix rank-difference protocol that produces constant-probab...
-
Codes and designs in multivariate $Q$-polynomial association schemes
Generalizes Delsarte bounds to multivariate Q-polynomial association schemes, deriving upper bounds on codes and designs characterized via Wilson polynomials, plus Lloyd-type conditions and applications to Lee distanc...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.