pith. sign in

Similarly, to enumerate all possible spacesV, it suffices to fix(u1Fq, u2Fq)a pair of subspaces ofF m q andvF q a subspace ofF n q

There are exactly 1 q+1 m 1 q n 1 q m−1 1 q subspacesVofF m×n q such that : •Vis generated by two rank one matrices, •the row space ofVis one-dimensional, 39 •and the column space

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 33

    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.