请输入您要查询的字词:

 

单词 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

    N2n/r=0d1(nr)
    where the code length is n digits, and the codewords are at a minimum Hamming distance d. See also coding bounds, Hamming bound.


随便看

 

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

 

Copyright © 2000-2023 Sciref.net All Rights Reserved
京ICP备2021023879号 更新时间:2024/6/30 19:42:28