Maximum-rank array codes and their application to crisscross error correction
From MaRDI portal
Publication:5753878
DOI10.1109/18.75248zbMath0721.94012OpenAlexW1993359877MaRDI QIDQ5753878
Publication date: 1991
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/673e30dab1e2e5d256013ab56109794388e164b0
Related Items (91)
On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Multiple-rate error-correcting coding scheme ⋮ Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ Non-linear maximum rank distance codes ⋮ Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ Optimal interleaving schemes for correcting two-dimensional cluster errors ⋮ Extending two families of maximum rank distance codes ⋮ Fast operations on linearized polynomials and their applications in coding theory ⋮ Further results on LCD generalized Gabidulin codes ⋮ Non-minimum tensor rank Gabidulin codes ⋮ Rank metric codes and zeta functions ⋮ Generalized Gabidulin codes over fields of any characteristic ⋮ Common Complements of Linear Subspaces and the Sparseness of MRD Codes ⋮ Twisted linearized Reed-Solomon codes: a skew polynomial framework ⋮ Covering Radius of Matrix Codes Endowed with the Rank Metric ⋮ A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes ⋮ List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques ⋮ On transform-domain error and erasure correction by Gabidulin codes ⋮ Constant dimension codes from multilevel construction based on matchings of complete hypergraphs ⋮ Fast decoding of Gabidulin codes ⋮ Optimal Ferrers diagram rank-metric codes from MRD codes ⋮ New MRD codes from linear cutting blocking sets ⋮ Duals of linearized Reed-Solomon codes ⋮ Tensor Codes and Their Invariants ⋮ On the generalised rank weights of quasi-cyclic codes ⋮ An enumeration of the equivalence classes of self-dual matrix codes ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ New semifields and new MRD codes from skew polynomial rings ⋮ Division algebras and MRD codes from skew polynomials ⋮ On a family of linear MRD codes with parameters \([8\times 8,16,7_q\)] ⋮ Doubly and triply extended MSRD codes ⋮ Some matroids related to sum-rank metric codes ⋮ Rank-metric codes and \(q\)-polymatroids ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ Rank-metric codes, generalized binomial moments and their zeta functions ⋮ Some new non-additive maximum rank distance codes ⋮ Matrix graphs and MRD codes over finite principal ideal rings ⋮ Weight spectra of Gabidulin rank-metric codes and Betti numbers ⋮ Partitions of matrix spaces with an application to \(q\)-rook polynomials ⋮ Saturating systems and the rank-metric covering radius ⋮ Constructions of perfect bases for classes of 3-tensors ⋮ Subspace packings: constructions and bounds ⋮ Galois geometries and coding theory ⋮ Unnamed Item ⋮ Rank weight hierarchy of some classes of polynomial codes ⋮ Quasi optimal anticodes: structure and invariants ⋮ Asymptotic behaviour of codes in rank metric over finite fields ⋮ Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 ⋮ Low-rank parity-check codes over Galois rings ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank ⋮ Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects ⋮ Low-rank matrix recovery using Gabidulin codes in characteristic zero ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Generalized bilinear forms graphs and MRD codes over a residue class ring ⋮ Covering of subspaces by subspaces ⋮ Roos bound for skew cyclic codes in Hamming and rank metric ⋮ On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes. ⋮ Subspaces of matrices with special rank properties ⋮ Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound ⋮ Several classes of optimal Ferrers diagram rank-metric codes ⋮ Generalized vector space partitions ⋮ On decoding additive generalized twisted Gabidulin codes ⋮ Tensor Representation of Rank-Metric Codes ⋮ On the list decodability of self-orthogonal rank-metric codes ⋮ On \(q\)-covering designs ⋮ Probabilistic algorithm for finding roots of linearized polynomials ⋮ Error and erasure correcting algorithms for rank codes ⋮ Spaces of Hankel matrices over finite fields ⋮ Partition-balanced families of codes and asymptotic enumeration in coding theory ⋮ Robust Positioning Patterns with Low Redundancy ⋮ Random construction of partial MDS codes ⋮ Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices ⋮ On (partial) unit memory codes based on Gabidulin codes ⋮ Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes ⋮ MRD codes with maximum idealizers ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ Application of \(\mathcal{T}\)-direct codes in multiple-rate codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Interleaving schemes on circulant graphs with two offsets ⋮ \(q\)-polymatroids and their relation to rank-metric codes ⋮ Wei-type duality theorems for rank metric codes ⋮ Partial ‐Parallelisms in Finite Projective Spaces ⋮ Encoding and decoding of several optimal rank metric codes ⋮ Some important results on 𝒯-Direct codes ⋮ Rank-Metric Codes and Their Applications ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ Equidistant codes in the Grassmannian ⋮ Construction of LCD-MRD codes of length n > N ⋮ Subspace codes from Ferrers diagrams
This page was built for publication: Maximum-rank array codes and their application to crisscross error correction
