Pages that link to "Item:Q5753878"

The following pages link to Maximum-rank array codes and their application to crisscross error correction (Q5753878):

Displaying 50 items.

• Non-linear maximum rank distance codes (Q281322) (← links)
• On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes (Q398944) (← links)
• List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques (Q398965) (← links)
• On transform-domain error and erasure correction by Gabidulin codes (Q398969) (← links)
• Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank (Q490875) (← links)
• Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
• Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects (Q669602) (← links)
• On (partial) unit memory codes based on Gabidulin codes (Q764387) (← links)
• MRD codes with maximum idealizers (Q776314) (← links)
• Wei-type duality theorems for rank metric codes (Q782848) (← links)
• An enumeration of the equivalence classes of self-dual matrix codes (Q894999) (← links)
• Galois geometries and coding theory (Q908053) (← links)
• Subspaces of matrices with special rank properties (Q972794) (← links)
• Probabilistic algorithm for finding roots of linearized polynomials (Q1008961) (← links)
• Error and erasure correcting algorithms for rank codes (Q1009077) (← links)
• Interleaving schemes on circulant graphs with two offsets (Q1043964) (← links)
• Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases (Q1620975) (← links)
• Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
• Rank metric codes and zeta functions (Q1650435) (← links)
• Generalized Gabidulin codes over fields of any characteristic (Q1650439) (← links)
• Some new non-additive maximum rank distance codes (Q1696763) (← links)
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355) (← links)
• Universal secure rank-metric coding schemes with optimal communication overheads (Q1733972) (← links)
• Low-rank matrix recovery using Gabidulin codes in characteristic zero (Q1743301) (← links)
• Generalized bilinear forms graphs and MRD codes over a residue class ring (Q1747930) (← links)
• On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes. (Q1763501) (← links)
• On the list decodability of self-orthogonal rank-metric codes (Q1800706) (← links)
• Spaces of Hankel matrices over finite fields (Q1805195) (← links)
• Fast decoding of Gabidulin codes (Q1934220) (← links)
• Roos bound for skew cyclic codes in Hamming and rank metric (Q1995207) (← links)
• On decoding additive generalized twisted Gabidulin codes (Q2040309) (← links)
• Application of \(\mathcal{T}\)-direct codes in multiple-rate codes (Q2079994) (← links)
• An asymptotically optimal construction of almost affinely disjoint subspaces (Q2081335) (← links)
• \(q\)-polymatroids and their relation to rank-metric codes (Q2082523) (← links)
• Encoding and decoding of several optimal rank metric codes (Q2096654) (← links)
• On the list decodability of rank-metric codes containing Gabidulin codes (Q2119948) (← links)
• Multiple-rate error-correcting coding scheme (Q2121570) (← links)
• Extending two families of maximum rank distance codes (Q2135573) (← links)
• Further results on LCD generalized Gabidulin codes (Q2142968) (← links)
• Non-minimum tensor rank Gabidulin codes (Q2154304) (← links)
• Twisted linearized Reed-Solomon codes: a skew polynomial framework (Q2168840) (← links)
• Rank-metric codes and \(q\)-polymatroids (Q2196479) (← links)
• Equivalence and characterizations of linear rank-metric codes based on invariants (Q2197149) (← links)
• Rank-metric codes, generalized binomial moments and their zeta functions (Q2197202) (← links)
• Matrix graphs and MRD codes over finite principal ideal rings (Q2197991) (← links)
• Partitions of matrix spaces with an application to \(q\)-rook polynomials (Q2198967) (← links)
• Subspace packings: constructions and bounds (Q2200513) (← links)
• Low-rank parity-check codes over Galois rings (Q2227130) (← links)
• Covering of subspaces by subspaces (Q2248651) (← links)
• Several classes of optimal Ferrers diagram rank-metric codes (Q2273871) (← links)