pith. sign in

Thus, the number of spaces spanned by such matrices is m 2 q n 2 q q(q2 −1) = q(q m −1)(q m−1 −1)(q n −1)(q n−1 −1) (q−1) 2(q2 −1)

There are exactly m 2 q n 2 q q(q−1)(q 2 −1) = q(q m−1)(qm−1−1)(qn−1)(qn−1−1) (q−1)(q 2−1) matrices of rank exactly two inF m×n q (see [25, Theorem 25

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.IT 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Decoding Algorithms for Tensor Codes

cs.IT · 2026-04-17 · unverdicted · novelty 7.0

Decoding algorithms for generalized tensor codes that use fibre-wise decoding and a generalization of Loidreau-Overbeck's method to correct errors under metrics bounded by tensor rank.

citing papers explorer

Showing 1 of 1 citing paper.

  • Decoding Algorithms for Tensor Codes cs.IT · 2026-04-17 · unverdicted · none · ref 31

    Decoding algorithms for generalized tensor codes that use fibre-wise decoding and a generalization of Loidreau-Overbeck's method to correct errors under metrics bounded by tensor rank.