“Gilbert–Varshamov bound”的概念、定义、翻译、参考文献-科学参考

单词	Gilbert–Varshamov bound
释义	Gilbert–Varshamov bound Computer The theorem that the maximum possible number, N, of codewords in a binary linear block code is bounded by $N \geq 2^{n} / \sum_{r = 0}^{d - 1} (\begin{array}{l} n \\ r \end{array})$ where the code length is n digits, and the codewords are at a minimum Hamming distance d. See also coding bounds, Hamming bound.
随便看	diagonalizable diagonalization diagonally dominant matrix diagonal matrix diagonal(of a matrix) diagonal(of a polygon) diagonal(of a polyhedron) diagonal procedure diagonal relationship diagonals model diagram diagrammatic technique diakinesis dialect dialectic dialectical materialism dialectical school dialectical theology dialectics dialetheia dialetheism diallage diallelus dialler dialler program

科学参考收录了60776条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。