×
Abstract—We consider subspace codes, called multicomponent codes with zero prefix (MZP codes), whose subspace code distance is twice their dimension.
Oct 19, 2016 · We consider subspace codes, called multicomponent codes with zero prefix (MZP codes), whose subspace code distance is twice their dimension.
Oct 22, 2024 · We consider subspace codes, called multicomponent codes with zero prefix (MZP codes), whose subspace code distance is twice their dimension.
Jun 18, 2020 · The corresponding codes are known as quantum maximum distance separable (QMDS) codes. In this paper, we derive additional bounds on the ...
People also ask
Maximum-distance linear codes (Corresp.) Described here is a linear code that has a maximum distance between codewords of k for a code of order 2^k .
We consider subspace codes, called multicomponent codes with zero prefix (MZP codes), whose subspace code distance is twice their dimension.
Sep 1, 2006 · Multicomponent codes with maximum code distance. We consider subspace codes, called multicomponent codes with zero prefix (MZP codes), whose ...
Oct 22, 2024 · Codes with maximum rank distance are described; their spectrum is obtained; and encoding and decoding algorithms are given.
These codes reach the upper Singleton bound in the rank metric and therefore they are called maximum rank distance (MRD) codes. The vector representation of the ...
This allows us to introduce the family of maximum flag-rank distance codes, that are flag-rank-metric codes meeting the Singleton-like bound with equality. ...
Missing: Multicomponent | Show results with:Multicomponent