Pages that link to "Item:Q3939716"
From MaRDI portal
The following pages link to A new class of codes meeting the Griesmer bound (Q3939716):
Displaying 6 items.
- An improvement of the Griesmer bound for some small minimum distances (Q1083427) (← links)
- A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry (Q1262869) (← links)
- A new class of nonbinary codes meeting the Griesmer bound (Q1314334) (← links)
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (Q1802134) (← links)
- Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities (Q2432944) (← links)
- New upper bounds and constructions of multi-erasure locally recoverable codes (Q6107451) (← links)
