Alternative names: Two-dimensional code.
Root code for the Matrix Kingdom
Description
Encodes \(K\) states (codewords) in an \(m\times n\) array of coordinates over a field (e.g., the Galois field \(\mathbb{F}_q\) or the complex numbers \(\mathbb{C}\)).Member of code lists
Primary Hierarchy
Parents
Matrix-based code alphabets are additive groups.
Matrix-based code
Children
Subspace codes are represented by generator matrices of subspaces of \(\mathbb{F}_q^n\).
\(q\)-ary codeConstant-weight Combinatorial design Self-dual additive Linear \(q\)-ary Gray Evaluation Self-dual linear Cyclic QR Projective geometry Quantum-inspired classical block Tanner \(q\)-ary LDPC Divisible AG OA Perfect Nearly perfect Perfect binary GRM MDS GRS Balanced
Matrix-based codes over \(\mathbb{F}_q\) whose codewords are vectors reduce to \(q\)-ary codes. Elements of fields such as \(\mathbb{F}_{p^{ml}}\) can be written as \(m\)-dimensional vectors over \(\mathbb{F}_{p^{l}}\) or \((m\times l)\)-dimensional matrices over \(\mathbb{F}_p\). This idea is used to convert between ordinary block codes and matrix-based codes such as disk array codes and rank-metric codes.
Page edit log
- Victor V. Albert (2022-02-16) — most recent
Cite as:
“Matrix-based code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/matrices_into_matrices