Pages that link to "Item:Q2266696"
From MaRDI portal
The following pages link to Characterization of two classes of codes that attain the Griesmer bound (Q2266696):
Displaying 10 items.
- A class of optimal linear codes of length one above the Griesmer bound (Q1009128) (← links)
- Classification of Griesmer codes and dual transform (Q1043574) (← links)
- New sufficient existence conditions for the codes that meet the Varshamov-Griesmer bound (Q1083429) (← links)
- Divisibility of codes meeting the Griesmer bound (Q1268604) (← links)
- A new class of nonbinary codes meeting the Griesmer bound (Q1314334) (← links)
- Linear codes over \(\mathbb {F}_{q}[x]/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound (Q1801098) (← links)
- A geometric approach to classifying Griesmer codes (Q2384039) (← links)
- Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities (Q2432944) (← links)
- A characterization of certain Griesmer codes: MMD codes in a more general sense (Q4503373) (← links)
- (Q5132984) (← links)
