Pages that link to "Item:Q2299619"
From MaRDI portal
The following pages link to Partition-balanced families of codes and asymptotic enumeration in coding theory (Q2299619):
Displaying 15 items.
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding (Q2034992) (← links)
- Rank-metric lattices (Q2111776) (← links)
- Density of free modules over finite chain rings (Q2158271) (← links)
- Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\) (Q2305914) (← links)
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices (Q2310392) (← links)
- Identifiers for MRD-codes (Q2419060) (← links)
- Bounds in the Lee metric and optimal codes (Q2689354) (← links)
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes (Q5073706) (← links)
- An Assmus--Mattson Theorem for Rank Metric Codes (Q5232151) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- Weighted subspace designs from \(q\)-polymatroids (Q6071951) (← links)
- Rank-Metric Codes, Semifields, and the Average Critical Problem (Q6100610) (← links)
- Densities of codes of various linearity degrees in translation-invariant metric spaces (Q6130607) (← links)
- Saturating systems and the rank-metric covering radius (Q6185345) (← links)
- Structure of CSS and CSS-T quantum codes (Q6618612) (← links)
