A new class of codes meeting the Griesmer bound
From MaRDI portal
Publication:3939716
DOI10.1109/TIT.1981.1056405zbMATH Open0481.94006MaRDI QIDQ3939716FDOQ3939716
Authors: Tor Helleseth, Henk van Tilborg 
Publication date: 1981
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Cited In (6)
- Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities
- New upper bounds and constructions of multi-erasure locally recoverable codes
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- A new class of nonbinary codes meeting the Griesmer bound
- 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
- An improvement of the Griesmer bound for some small minimum distances
This page was built for publication: A new class of codes meeting the Griesmer bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3939716)
