A new class of codes meeting the Griesmer bound
From MaRDI portal
Publication:3939716
DOI10.1109/TIT.1981.1056405zbMath0481.94006MaRDI QIDQ3939716
Tor Helleseth, Henk C. A. van Tilborg
Publication date: 1981
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (6)
An improvement of the Griesmer bound for some small minimum distances ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities ⋮ A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry] ⋮ 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 ⋮ A new class of nonbinary codes meeting the Griesmer bound
This page was built for publication: A new class of codes meeting the Griesmer bound
