Symmetric matrices and codes correcting rank errors beyond the (d-1)/2 bound
From MaRDI portal
Publication:2489925
Recommendations
- Coding and Cryptography
- On the symmetric rank-m correction of matrices
- Low rank approximation and decomposition of large matrices using error correcting codes
- Asymptotically optimal matrix codes with Hamming and rank distances
- Publication:4886141
- Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
- Lower bounds and constructions for \(q\)-ary codes correcting asymmetric error
- New upper bounds on the size of codes correcting asymmetric errors (Corresp.)
- Error Correcting Codes from Quasi-Hadamard Matrices
- Error-free matrix symmetrizers and equivalent symmetric matrices
Cites work
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 910964 (Why is no real title available?)
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
- Maximum rank distance codes as space~time codes
- Maximum-rank array codes and their application to crisscross error correction
- Symmetric rank codes
- Theory of codes with maximum rank distance
Cited in
(9)- Error and erasure correcting algorithms for rank codes
- Coding and Cryptography
- Rank-metric complementary dual codes
- Hermitian rank distance codes
- Algebraic structures of MRD codes
- On symmetric and Hermitian rank distance codes
- Rank-metric codes and their applications
- Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
- Symmetric rank codes
This page was built for publication: Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489925)