Skip to search formSkip to main contentSkip to account menu

Griesmer bound

In the mathematics of coding theory, the Griesmer bound, named after James Hugo Griesmer, is a bound on the length of binary codes of dimension k and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
CodeCoding theoryElias Bassalygo boundGilbert–Varshamov bound

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Optimal binary codes from trace codes over a non-chain ring
2012
2012
Classification of ternary [40s+28,4] optimal self-orthogonal codes
Based on a relationship between a generator matrix of a given code and its weight distribution, all ternary [40s+28,4,27s+18… 
2002
2002
Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa
AbstractThis article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes… 
1997
1997
On the Achievement of the Griesmer Bound
  • T. Maruta
  • Des. Codes Cryptogr.
  • 1997
  • Corpus ID: 5469582
The main theorem in this paper is that there does not exist an [n,k,d]q code with d = (k-2)qk-1 - (k-1)qk-2 attaining the… 
1992
1992
On the construction of [q4 + q2 − q, 5,q4 − q3 + q2 − 2q; q]-codes meeting the Griesmer bound
It is unknown whether or not there exists an [87, 5, 57; 3]-code. Such a code would meet the Griesmer bound. The purpose of this… 
1985
1985
On the covering radius of binary, linear codes meeting the Griesmer bound
Let g(k, d) = \sum_{i=0}^{k-1} \lceil d / 2^{i} \rceil . By the Griesmer bound, n \geq g(k, d) for any binary, linear [n, k, d… 
1981
1981
A new class of codes meeting the Griesmer bound
An infinite sequence of k -dimensional binary linear block codes is constructed with parameters n=2^{k}+2^{k-2}-15,d=2^{k-1}+2^{k… 
1973
1973
A note on the Griesmer bound
Griesmer's lower bound for the word length n of a linear code of dimension k and minimum distance d is shown to be sharp for… 
1973
1973
A note on the Griesmer bound (Corresp.)
Griesmer's lower bound for the word length n of a linear code of dimension k and minimum distance d is shown to be sharp for… 
Highly Cited
1965
Highly Cited
1965
Algebraically Punctured Cyclic Codes
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)